C++ 统计数组中每个数字出现的次数

#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

int main() {
    int n;
    cin >> n;
    vector<int> nums(n);
    for (int i = 0; i < n; i++) {
        cin >> nums[i];
    }

    int maxNum = *max_element(nums.begin(), nums.end());
    vector<int> count(maxNum + 1, 0);
    for (int i = 0; i < n; i++) {
        count[nums[i]]++;
    }

    for (int i = 0; i <= maxNum; i++) {
        cout << count[i] << endl;
    }

    return 0;
}