Leetcode Problem 239. Sliding Window Maximum
Leetcode Solutions
Key approach of the solution: Monotonic Deque
- Initialize an empty deque
dqto store indices of elements. - Initialize a list
resto store the maximum of each window. - Iterate over the first
kelements and maintain the deque in non-increasing order based on the element values. - Add the maximum element of the first window to
res. - Iterate over the rest of the elements starting from index
k.- If the front element of
dqis outside the current window, remove it. - Maintain the deque in non-increasing order for the current element.
- Add the maximum element of the current window to
res.
- If the front element of
- Return
res.
Key approach of the solution: Brute Force
Ask Question
Programming Language
Purpose:
image/screenshot of info(optional)
Full Screen
Loading...
Suggested Answer
Answer
Full Screen
Copy Answer Code
Loading...