diff --git a/notes/Leetcode 题解 - 栈和队列.md b/notes/Leetcode 题解 - 栈和队列.md index 1cd6e6ee..92eaf67e 100644 --- a/notes/Leetcode 题解 - 栈和队列.md +++ b/notes/Leetcode 题解 - 栈和队列.md @@ -242,7 +242,7 @@ public int[] nextGreaterElements(int[] nums) { while (!pre.isEmpty() && nums[pre.peek()] < num) { next[pre.pop()] = num; } - if (i < n){ + if (i < n) { pre.push(i); } }