leetcode Ch6-Data Structure

1. Sliding Window Maximum

 class Solution {
 public:
     vector<int> maxSlidingWindow(vector<int> &nums, int k) {
         deque<int> dq;
         vector<int> res;
         for (int i = ; i < nums.size(); i++) {
             if (!dq.empty() && dq.front() == i - k) {
                 dq.pop_front();
             }
             while (!dq.empty() && nums[dq.back()] < nums[i]) {
                 dq.pop_back();
             }
             dq.push_back(i);
             if (i >= k - ) {
                 res.push_back(nums[dq.front()]);
             }
         }
         return res;
     }
 };

需要用到单调队列，详细可参考此文。