ALG-H007HardDeque
Peak Value per Window
Return the maximum element of every contiguous window of exactly k elements, ordered by the window starting index.
Contract
input numbers: integer[]
input k: integer
return integer[]
Constraints
- • 1 <= k <= length of numbers
Examples
Example 1
numbers = [1, 3, -1, -3, 5, 3, 6, 7]
k = 3
→ [3, 3, 5, 5, 6, 7]
Example 2
numbers = [1]
k = 1
→ [1]
5 judge tests (2 shown above). Target complexity: O(n).