LeetCode 697. 数组的度(滑动窗口)

class Solution {
public:
    int result(int m, int n, vector<int>& nums) {
        int i, left = INT_MAX;;
        for (i = 0; i < nums.size(); i++) {
            if (nums[i] == m) {
                left = min(i, left);
                n--;
                if (n == 0) return i - left + 1;
            }
        }
        return i - left;
    }

    int findShortestSubArray(vector<int>& nums) {
        map<int, int> mp;
        vector<int> m;
        vector<int> arr;
        int n = 0;
        for (int i = 0; i < nums.size(); i++) {
            mp[nums[i]]++;
        }
        for (auto it = mp.begin(); it != mp.end(); it++) {
            if (it->second >= n) {
                n = it->second;
            }
        }
        for (auto it = mp.begin(); it != mp.end(); it++) {
            if (it->second == n) {
                m.push_back(it->first);
            }
        }
        for (int i = 0; i < m.size(); i++) {
            arr.push_back(result(m[i], n, nums));
        }
        sort(arr.begin(), arr.end());
        return arr[0];
    }
};