int FindMax ( char * pIn , char * pOut ){char tmpOut [ 50 ] = { 0 }; //假如字符串不超过50字节int pos = 0 ;//临时数组索引for ( int i = 0 ; i < strlen ( pIn ); ++ i ){if ( pIn [ i ] <= '9' && pIn [ i ] >= '0' ){tmpOut [ pos ++ ] = pIn [ i ];continue ;}else{if ( strlen ( tmpOut ) > strlen ( pOut )){memcpy ( pOut , tmpOut , strlen ( tmpOut ));pos = 0 ;memset ( tmpOut , 0 , sizeof ( tmpOut ));}}}return strlen ( pOut );}int main (){char str [] = "asdfa1111jlasdf1111112uoiu55" ;char szResult [ 50 ] = { 0 };int len = FindMax ( str , szResult );std :: cout << "len = " << len << " result = " << szResult << std :: endl ;getchar();return 0 ;}
【c++】字符串中找出最长的连续数字字符串
最新推荐文章于 2024-07-30 23:38:11 发布