写一个函数int find(char s[],char t[]),该函数在字符串s中查找字符串t,如果找到,则返回字符串t在字符串s中的位置(整数值);否则返回-1.注意:用数组方式及两重循环来实现该函数.
#include<iostream>
using namespace std;
int find(char s[],char t[])
{
int len1=strlen(s),len2=strlen(t),i=0,j=0,k;
if(len1<len2)return -1;
while(i<=len1-len2)
{
k=i+1;
if(s[i]-t[j])i++;
else
{
while(1)
{
if(s[i++]-t[j++]){j=0;i=k;break;}
if(j==len2)return i-len2;
}
}
}
return -1;
}
int main()
{
char s[]="Hello C++ Jav Hello Java";
char t[]="Java";
cout<<find(s,t)<<endl;
system("PAUSE");
return 0;
}
============================================================================
#include<iostream>
using namespace std;
int find(char *str1,char *str2)
{
char *p=str1,*p1=str2,*q;
while(*p)
{
if(*p==*p1)
{
q=p;
do{
if(*p==*p1)p++,p1++;
else {p1=str2;break;}
}while(*p1&&*p);
if(!*p1)return q-str1+1;
}
else p++;
}
return 0;
}
int main()
{
char str1[]="abcc",str2[]="abc";
cout<<find(str1,str2)<<endl;
system("PAUSE");
return 0;
}