Skip to content

fix: fix js solution to lc problem: No.0503. Next Greater Element II #383

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
merged 1 commit into from
May 14, 2021
Merged

fix: fix js solution to lc problem: No.0503. Next Greater Element II #383

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
2 changes: 1 addition & 1 deletion solution/0500-0599/0503.Next Greater Element II/README.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -80,7 +80,7 @@ class Solution {
let res = new Array(n).fill(-1);
for (let i = 0; i < 2 * n; i++) {
let cur = nums[i % n];
while(stack.length > 0 && nums[stack[stack.length - 1]] < cur) {
while (stack.length > 0 && nums[stack[stack.length - 1]] < cur) {
res[stack.pop()] = cur;
}
stack.push(i % n);
Expand Down
2 changes: 1 addition & 1 deletion solution/0500-0599/0503.Next Greater Element II/README_EN.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -87,7 +87,7 @@ class Solution {
let res = new Array(n).fill(-1);
for (let i = 0; i < 2 * n; i++) {
let cur = nums[i % n];
while(stack.length > 0 && nums[stack[stack.length - 1]] < cur) {
while (stack.length > 0 && nums[stack[stack.length - 1]] < cur) {
res[stack.pop()] = cur;
}
stack.push(i % n);
Expand Down
2 changes: 1 addition & 1 deletion solution/0500-0599/0503.Next Greater Element II/Solution.js
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -8,7 +8,7 @@
let res = new Array(n).fill(-1);
for (let i = 0; i < 2 * n; i++) {
let cur = nums[i % n];
while(stack.length > 0 && nums[stack[stack.length - 1]] < cur) {
while (stack.length > 0 && nums[stack[stack.length - 1]] < cur) {
res[stack.pop()] = cur;
}
stack.push(i % n);
Expand Down