遞迴判斷數組是否是升序

//遞迴判斷數組是否是遞增<br />bool f(int a[],int n)<br />{<br />if (n==0)<br />{<br />return true;<br />}<br />if (n==2)<br />{<br />return a[n-1]>=a[n-2];<br />}<br />return f(a,n-1)&&(a[n-1]>=a[n-2]);<br />}

 

void main()<br />{<br />char *s = "abcd12345ed125ss123456789";<br />char out[100]={0};<br />cout<<continumax(out,s)<<endl;<br />}</p><p>int continumax(char *outputstr, char *inputstr)<br />{<br />char *inn = inputstr;<br />char *outt =outputstr;<br />char *temp=NULL;<br />char *final =NULL;<br />int maxnum=0;<br />int count=0;<br />while(*inn)<br />{<br />if (*inn>'0' && *inn<'9')<br />{<br />temp=inn;</p><p>while (*inn>'0' && *inn<'9')<br />{<br />count++;<br />inn++;<br />}<br />}<br />if (maxnum<count)//遇到字元的時候重新開始計數<br />{<br />maxnum = count;<br />count=0;<br />final = temp;<br />}<br />inn++;<br />}<br />for (int i=0;i<maxnum;i++)<br />{<br />*outt++ = *final++;<br />}<br />*outt = '/0';<br />cout<<outputstr<<endl;<br />return maxnum;<br />}<br />