C++统计整数出现最高频率次数的实现

```cpp #include <iostream> #include <cstring> #include <algorithm> using namespace std; int main() { int n; cin >> n; int count[101]; // 初始化数组元素为0 memset(count, 0, sizeof(count)); for (int i = 0; i < n; i++) { int num; cin >> num; // 对应数字的计数加1 count[num]++; } int maxCount = 0; for (int i = 0; i <= 100; i++) { // 找出最大的计数 maxCount = max(maxCount, count[i]); } cout << maxCount << endl; return 0; } ``` ######[AI问答 | 203点数解答 | 2026-05-23 21:43:53]