Leetcode: offer 59 - I. maximum value of sliding window

subject ： The finger of the sword Offer 59 - I. Maximum sliding window

The question ：

Given an array nums And the size of the sliding window k, Please find the maximum value in all sliding windows .

Ideas ：

Take priority queue , The team leader is a big element , Two data are stored in a limited queue , Values and positions , First, put the front k Put data into , When sliding the window , Add new elements , Check whether the biggest element of the team leader is the current window , If not, pop up , Until it is the current window .

Code ：

class Solution {
    
public:
    vector<int> maxSlidingWindow(vector<int>& nums, int k) {
    
        priority_queue<pair<int, int>>q;
        vector<int>temp;
        if(nums.size() == 0)return temp;
        for(int i = 0; i < k; i++){
    
            q.emplace(nums[i], i);
        }
        vector<int>ans = {
    q.top().first};
        for(int i = k; i < nums.size(); i++){
    
            q.emplace(nums[i], i);
            while(q.top().second <= i-k)q.pop();
            ans.push_back(q.top().first);
        }
        return ans;
    }
};