#include <iostream>
#include <string>
using namespace std;
string findsub(string &s)
{
string sub;
int i = 0;
while (i<s.size())
{
int l = 0;
while(isdigit(s[i]))
{
l++;
i++;
}
if(l> sub.length())
{
sub = s.substr(i-l,l);
}
i++;
}
return sub;
}
void main()
{
string s = "h12345sklf12hj21h3k1jh3k1j23h1jk23115kjhkjhkjh123456";
string sub = findsub(s);
cout<<sub;
system("pause");
}
找出字符串中最长的数字字符串
最新推荐文章于 2022-05-11 00:56:07 发布