C++ 字符串子串计数：寻找出现次数最多的 k-String

#include #include #include <unordered_map>

using namespace std;

int main() { string s; cin >> s; int k; cin >> k;

unordered_map<string, int> substrCount;

// Count the occurrences of substrings of length k
for (int i = 0; i <= s.length() - k; i++) {
    string substr = s.substr(i, k);
    substrCount[substr]++;
}

int maxCount = 0;

// Find the maximum count of a substring
for (auto it = substrCount.begin(); it != substrCount.end(); it++) {
    if (it->second > maxCount) {
        maxCount = it->second;
    }
}

cout << maxCount << endl;

return 0;

}