数据结构上机任务

 1 #include"stdio.h"
 2 #include"string.h" 
 3 main()
 4 {
 5     char a[100];
 6     char b[100]; 
 7     char subString[100]; 
 8     int j; 
 9     printf("请输入字符串A:"); 
10     scanf("%s",a);
11     printf("字符串A:%s\n",a);
12     for(int i =0; i<=strlen(a); i++)
13     {
14         b[i] = a[i]; 
15     } 
16     printf("字符串B:%s\n",b);
17     printf("请输入需要查找的子串:");
18     scanf("%s",subString); 
19     for(int i =0; i<strlen(a); i++)
20     {
21         int j = 0; 
22         if(a[i] == subString[j])
23         {    
24             int newi = i+1;
25             int newj = j+1; 
26             while(a[newi] == subString[newj] && a[newi] != '\0' && subString[newj] != '\0')
27             {
28                 newi++;
29                 newj++; 
30             }
31             if(subString[newj] == '\0')
32             {
33                 printf("%s是%s的子串",subString,a); 
34                 return 0; 
35             } 
36         } 
37     } 
38 } 

猜你喜欢

转载自www.cnblogs.com/sucker/p/10855514.html