problem 2.c

来自「北大青鸟软件工程师ppt的学生用书源代码」· C语言 代码 · 共 36 行

#include <stdio.h>
#include <string.h>
void main()
{
   char arr1[50], arr2[30];
   int counter1, counter2;

   printf("\n请输入一个主字符串：");
   gets(arr1);
   printf("\n请输入一个子字符串：");
   gets(arr2);

   for (counter1 = 0, counter2 = 0; arr1[counter1] != '\0' && 
              arr2[counter2] != '\0'; counter1++)
   {
      if (arr1[counter1] == arr2[counter2])
      {
         counter2++;
      }
      else
      {
         counter1 = counter1 - counter2;
         counter2 = 0;
      }
   }

   if (arr2[counter2] == '\0')
   {
      printf("\n子字符串出现的位子为 [%d] \n", (counter1 - counter2 + 1));
   }
   else
   {
      printf("\n主字符串不包含子字符串");
   }
}