Commit a66142c

committed

修改239滑动窗口最大值java代码注释严重错误

1 parent d5e0827 commit a66142cCopy full SHA for a66142c

File tree

-2

lines changed

-2

lines changed

Lines changed: 3 additions & 2 deletions

Original file line number	Diff line number	Diff line change
`@@ -267,7 +267,7 @@ class Solution {`
`267`	`267`	`//利用双端队列手动实现单调队列`
`268`	`268`	`/**`
`269`	`269`	`* 用一个单调队列来存储对应的下标,每当窗口滑动的时候,直接取队列的头部指针对应的值放入结果集即可`
`270`		`- * 单调队列类似 (tail -->) 3 --> 2 --> 1 --> 0 (--> head) (右边为头结点,元素存的是下标)`
	`270`	`+ * 单调递减队列类似 (head -->) 3 --> 2 --> 1 --> 0 (--> tail) (左边为头结点,元素存的是下标)`
`271`	`271`	`*/`
`272`	`272`	`class Solution {`
`273`	`273`	`public int[] maxSlidingWindow(int[] nums, int k) {`
`@@ -281,7 +281,7 @@ class Solution {`
`281`	`281`	`while(!deque.isEmpty() && deque.peek() < i - k + 1){`
`282`	`282`	`deque.poll();`
`283`	`283`	`}`
`284`		`- // 2.既然是单调,就要保证每次放进去的数字要比末尾的都大,否则也弹出`
	`284`	`+ // 2.维护单调递减队列:新元素若大于队尾元素,则弹出队尾元素,直到满足单调性`
`285`	`285`	`while(!deque.isEmpty() && nums[deque.peekLast()] < nums[i]) {`
`286`	`286`	`deque.pollLast();`
`287`	`287`	`}`
`@@ -894,3 +894,4 @@ public:`
`894`	`894`	`<a href="https://programmercarl.com/other/kstar.html" target="_blank">`
`895`	`895`	`<img src="../pics/网站星球宣传海报.jpg" width="1000"/>`
`896`	`896`	`</a>`
	`897`	`+`

Comments

(0)