字符串中最长子串

#include <iostream>using namespace std;int fun(char *src,char *dst){char *p = src;char *s = NULL;int i = 0;int len = 0;int maxlen = 0;while(*p != '\0'){s = p;while((*s >= 'A' && *s <= 'Z') || (*s >= 'a' && *s <= 'z') )s++;len = s - p;if(len > maxlen){maxlen = len;i = 0;while(p < s)dst[i++] = *p++;//总是保存最长子串dst[i]='\0';}elsep++;}return maxlen;}void main(){char *s = "12345ILOVECHINA123456AGOODCOMPANY321";char dst[100];int a = fun(s, dst);printf("%d\n%s\n", a, dst);}