Sliding Window Maximum about open-source HOT 3 CLOSED

Oh i understand. Thank you for the explanation

from open-source.

I'm sorry but I do not understand the output. How do you have 6 numbers in the output sliding window when there are only maximum 3 (k=3) elements in the window.
Also how do you compare two sliding windows ? Lexicographical or sum or maximum element in the window?

from open-source.

As shown in the explanation, the window of K (here 3) keeps moving across the array, in the first case the maximum in that window of k is the value 3 ([1 3 -1]). then the window moves forward by one and the maximum in that window is 3 ([3 -1 3]) and so on. So the final output array will be of length (N-K+1) and in each window you have to check for the maximum integer.

from open-source.