滑动窗口的最大值

题目出处：https://leetcode-cn.com/problems/hua-dong-chuang-kou-de-zui-da-zhi-lcof/

 思路：双指针维护区间大小，用map记录区间每个值出现的次数

class Solution {
public:
    vector<int> maxSlidingWindow(vector<int>& nums, int k) {
        if(nums.size() == 0){
            return {};
        }
        map<int, int> mp;
        for(int i = 0; i < k; ++i){
           ++mp[nums[i]];
        }
        
        vector<int> ans;
        int l = 0, r = k-1;
        while(r < nums.size()){
            ans.push_back(mp.rbegin()->first);
            --mp[nums[l]];
            if(mp[nums[l]] == 0){
               mp.erase(nums[l]);
            }
            ++l;
            ++r;
            if(r == nums.size()){
               break; 
            }
            ++mp[nums[r]];
        }    
        return ans;
    }
};