题解 | #在字符串中找出连续最长的数字串#

#include<iostream>
#include<string>
#include<vector>
using namespace std;
int main()
{
    string s;
    while (cin>>s)
    {
        int maxm = 0;
        vector<int> p;
        for (int i=0,j=0;i<s.size();i=j+1)
        {
            for(;('0'>s[i] || s[i]>'9') && i<s.size();i++);
            for (j=i;'0'<=s[j] && s[j]<='9' && j<s.size();j++);
            if ((j-i)==maxm)
                p.push_back(i);
            else if ((j-i)>maxm)
            {
                maxm = j - i;
                p.clear();
                p.push_back(i);
            }
        }
        for (auto i:p)
            for (int j=0;j<maxm;j++)
                cout<<s[i+j];
        cout<<','<<maxm<<endl;
    }
}