Leetcode刷题笔记(c++)

class Solution {
public:
    vector maxSlidingWindow(vector& nums, int k) {
        priority_queue>q;
        q.emplace(nums[0],0);
        for(int i=1;i
            q.emplace(nums[i],i);
        }
        vectorout;
        for(int i=k-1;i
            q.emplace(nums[i],i);
            while(q.top().second
                q.pop();
            }
            out.emplace_back(q.top().first);
        }
        return out;
    }
};