- //求两个串中的第一个最长子串
- char * subStr(char *str1,char *str2)
- {
- char *subString;
- int index = 0 ;
- int max = 0,now = 0;
- int len1 = strlen(str1);
- int len2 = strlen(str2);
- for (int i = 0; i<len1 ; i++)
- for (int j = 0 ; j<len2 ; j++)
- {
- for (int ii = i,jj = j; str1[ii] == str2[jj] && ii<len1 && jj<len2; ii++,jj++)
- {
- now++;
- }
- if(now > max)
- {
- index = i;
- max = now;
- }
- now = 0;
- }
- subString = new char[max+1];
- for (int i1 = 0 ,j1 = index ; i1<max ; i1++,j1++)
- {
- subString[i1] = str1[j1];
- }
- subString[max] = '/0';
- return subString;
- }