题解 | #在字符串中找出连续最长的数字串# 计数排序思想求最大值

the code says it all:

#include <bits/stdc++.h>

using namespace std;

const int N = 1010;
string cnt[N];

void solve(string s) 
{
    s += '*';
    string t = "";
    int mxlen = -1;
    for (int i =0; i < s.size(); i++) {
        char c = s[i];
        if (isdigit(c)) {
            t += c;
        }
        else {
            int len = t.size();
            if (len) {
                cnt[len] += t;
                t = "";
                mxlen = max(mxlen, len);
            }
        }
    }
    cout << cnt[mxlen] << ',' << mxlen << endl;
}

int main()
{
    string s;
    for (; getline(cin, s); memset(cnt, 0, sizeof(cnt)))
        solve(s);
    return 0;
}