leetcode-剑指offer59-I 滑动窗口的最大值

class Solution {
public:
    int get_Max(queue<int> que)
    {
        int max_num = que.front();
        while(!que.empty())
        {
            max_num = max(que.front(), max_num);
            que.pop();
        }
        return max_num;
    }

    vector<int> maxSlidingWindow(vector<int>& nums, int k) {
        queue<int>que;
        vector<int>ans;
        if(nums.empty())
            return ans;
        int max_num = nums[0];
        for(int i=0;i<k;i++)
        {
            que.push(nums[i]);
            max_num = max(max_num, nums[i]);
        }
        
        ans.push_back(max_num);
        for(int i=1;i+k<=nums.size();i++)
        {
            que.pop();
            que.push(nums[i+k-1]);
            if(nums[i-1] == max_num)
            {
                max_num = get_Max(que);
            }
            else
                max_num = max(nums[i+k-1], max_num);
            ans.push_back(max_num);
        }
        return ans;
    }
};