Lunski's Clutter

This is a place to put my clutters, no matter you like it or not, welcome here.

0%

Posted on In
Symbols count in article: 256 Reading time ≈ 1 mins.

這時候就要喝熱紅酒啊啊啊

Read more »

Posted on Edited on In
Symbols count in article: 790 Reading time ≈ 1 mins.

img

實現洗碗精自由@w@/（誤。

Read more »

Posted on In
Symbols count in article: 172 Reading time ≈ 1 mins.

做好自身，造福他人。

Read more »

Posted on Edited on In
Symbols count in article: 1.7k Reading time ≈ 2 mins.

You are given an array of integers nums, there is a sliding window of size k which is moving from the very left of the array to the very right. You can only see the k numbers in the window. Each time the sliding window moves right by one position.

Return the max sliding window.

Example 1:

1
2
3
4
5
6
7
8
9
10
11
Input: nums = [1,3,-1,-3,5,3,6,7], k = 3
Output: [3,3,5,5,6,7]
Explanation: 
Window position                Max
---------------               -----
[1  3  -1] -3  5  3  6  7       3
 1 [3  -1  -3] 5  3  6  7       3
 1  3 [-1  -3  5] 3  6  7       5
 1  3  -1 [-3  5  3] 6  7       5
 1  3  -1  -3 [5  3  6] 7       6
 1  3  -1  -3  5 [3  6  7]      7

Example 2:

1
2
Input: nums = [1], k = 1
Output: [1]
Read more »