//递归判断数组是否是递增 bool f(int a[],int n) { if (n==0) { return true; } if (n==2) { return a[n-1]>=a[n-2]; } return f(a,n-1)&&(a[n-1]>=a[n-2]); } void main() { char *s = "abcd12345ed125ss123456789"; char out[100]={0}; cout<<continumax(out,s)<<endl; } int continumax(char *outputstr, char *inputstr) { char *inn = inputstr; char *outt =outputstr; char *temp=NULL; char *final =NULL; int maxnum=0; int count=0; while(*inn) { if (*inn>'0' && *inn<'9') { temp=inn; while (*inn>'0' && *inn<'9') { count++; inn++; } } if (maxnum<count)//遇到字符的时候重新开始计数 { maxnum = count; count=0; final = temp; } inn++; } for (int i=0;i<maxnum;i++) { *outt++ = *final++; } *outt = '/0'; cout<<outputstr<<endl; return maxnum; }