g0201_0300.s0239_sliding_window_maximum.Solution.cpp Maven / Gradle / Ivy

Go to download

Show more of this group Show more artifacts with this name
Show all versions of leetcode-in-all Show documentation

104 LeetCode algorithm problem solutions

The newest version!

// #Hard #Top_100_Liked_Questions #Array #Heap_Priority_Queue #Sliding_Window #Queue
// #Monotonic_Queue #Udemy_Arrays #Big_O_Time_O(n*k)_Space_O(n+k)
// #2024_05_24_Time_164_ms_(80.55%)_Space_132.2_MB_(99.45%)

#include 
#include 

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