[BD-EXAM]求字符串的最长连续数字子串

用nowLen记录当前的连续数字串长度，maxLen记录当前的最长连续数字串的长度，tailPos记录当前最长连续数字串的最后一个元素的下标。考察当前位时候，根据是数字还是非数字字符进行判断。是数字，看是不是和前面的字符是连续的，是连续的，则设计nowLen,并考察此时nowLen是否超过了当前的maxLen，超过了则设置maxLen和tailPos，不是数字则将nowLen直接置为0。

[程序]

/******************************************************************* * * DESCRIPTION: 2010年Baidu Easy Problem * 求字符串中的最长数字串 * * AUTHOR:Neesky * * DATE:2009-10-15 * *******************************************************************/ #define MAXSIZE 100 /** include files **/ #include <iostream> using namespace std; /// <summary> /// Copy String from srcStr to DesStr /// </summary> /// <param name="srcStr"></param> /// <param name="tailPos">srcStr's tailPos position</param> /// <param name="len">length</param> /// <param name="desStr"></param> /// <returns></returns> void CopyStringFromTail(const char* srcStr,int tailPos, int len, char * desStr) { assert(MAXSIZE>len); desStr[len]='/0'; for(int i=len-1;i>=0;--i) desStr[i]=srcStr[tailPos--]; return; } /// <summary> /// Return the longest number substring's length /// Only find out the First substring /// </summary> /// <param name="inputStr">Input String</param> int maxContinuNum(const char *inputStr,char *outputStr) { if(inputStr==NULL)return -1; int nowLen=0,maxLen=0,i=0; int tailPos=-1; //Initialize the first Char if(isdigit(inputStr[i]))//is Number { maxLen=nowLen=1; tailPos=0; } while(inputStr[++i]!='0') { if(isdigit(inputStr[i]))//Now is Digit { nowLen=(isdigit(inputStr[i-1])&&inputStr[i-1]+1==inputStr[i])?nowLen+1:1;//i-1 is digit if(nowLen>maxLen) { maxLen=nowLen; tailPos=i; } }else{//Now is Not Digit nowLen=0; } } CopyStringFromTail(inputStr,tailPos,maxLen,outputStr);//Copy the Substring return maxLen; } /// <summary> /// Solve this Problem /// </summary> /// <param name="inputString"></param> /// <returns></returns> void SolveProblem(const char *inputString) { char OutputString[MAXSIZE]; int maxLen=maxContinuNum(inputString,OutputString);//Call Core Function cout<<"/nMax Continue Number Length in /""<<inputString<<"/": "<<endl; cout<<"--length is :"<<maxLen<<" --It is :"<<OutputString<<endl; return; } /// <summary> /// Main Programming /// </summary> /// <param name="argc"></param> /// <param name="argv"></param> /// <returns></returns> int main (int argc, char *argv[]) { SolveProblem("abcdbd123abcd1234a123456789"); return(0); }

mingw32-make: Nothing to be done for `all'.

Debug/Baidu20091013-5.exe 



Max Continue Number Length in "abcdbd123abcd1234a123456789": 

--length is :9  --It is :123456789