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

#include <iostream>
#include <vector>

using namespace std;

int main() {
    string str;
    while (cin >> str) {
        int n = str.length();
        int maxLen = 0;
        vector<int> dp(n + 1, 0);
        vector<pair<int, int>> res;

        for (int i = 1; i <= n; i++)
            if (str[i - 1] >= '0' && str[i - 1] <= '9') {
                dp[i] = dp[i -1] + 1;
                if (dp[i] > maxLen) {
                    res.clear();
                    maxLen = dp[i];
                    res.push_back({ i, maxLen });
                }
                else if (dp[i] == maxLen) {
                    res.push_back({ i, maxLen });
                }
            }

        for (auto iter : res)
            cout << str.substr(iter.first - iter.second, iter.second);

        cout << "," << maxLen << endl;
    }
}