問題
Slide a window of size k across the list one step at a time and report the maximum inside each window. A deque keeps this O(n).
Implement window_maximums(numbers, k).
Input
numbers: The list of integers. k: The window size.
Output
Return the maximum of each window, left to right.
制約
1 ≤ k ≤ length ≤ 200,000
例
例 1
入力：
k = 3
numbers = [1, 3, -1, -3, 5, 3, 6, 7]
期待される出力：
expected = [3, 3, 5, 5, 6, 7]入力：
long long k = 3;
std::vector<long long> numbers = {1, 3, -1, -3, 5, 3, 6, 7};
期待される出力：
std::vector<long long> expected = {3, 3, 5, 5, 6, 7};入力：
long k = 3;
long[] numbers = new long[] {1, 3, -1, -3, 5, 3, 6, 7};
期待される出力：
long[] expected = new long[] {3, 3, 5, 5, 6, 7};解説
Windows [1,3,-1], [3,-1,-3], [-1,-3,5], … have maxima 3, 3, 5, 5, 6, 7.
例 2
入力：
k = 1
numbers = [4, 2]
期待される出力：
expected = [4, 2]入力：
long long k = 1;
std::vector<long long> numbers = {4, 2};
期待される出力：
std::vector<long long> expected = {4, 2};入力：
long k = 1;
long[] numbers = new long[] {4, 2};
期待される出力：
long[] expected = new long[] {4, 2};解説
Windows of one element are the elements themselves: [4, 2].
参考資料
この課題はCodeUtility用に調整されています。上記の説明と制約に従ってください。