Skip to content

feat: add typescript solutions to lc problem: No.0503 #886

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 8 commits into from
Jan 6, 2023
Merged

feat: add typescript solutions to lc problem: No.0503 #886

Show file tree
Hide file tree
Changes from 1 commit
Commits
Show all changes
8 commits
Select commit Hold shift + click to select a range
3d37d57
feat: add typescript solutions to lc problem: No.0503
caohonghai Jan 6, 2023
260f3e5
Update solution/0500-0599/0503.Next Greater Element II/README.md
caohonghai Jan 6, 2023
9d87a56
Update README_EN.md
caohonghai Jan 6, 2023
5cc9721
Update solution/0500-0599/0503.Next Greater Element II/Solution.ts
caohonghai Jan 6, 2023
c09b075
Update solution/0500-0599/0503.Next Greater Element II/Solution.ts
caohonghai Jan 6, 2023
278f065
Update README.md
yanglbme Jan 6, 2023
b4bc492
Update README_EN.md
yanglbme Jan 6, 2023
38e9c4f
Update Solution.ts
yanglbme Jan 6, 2023
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
16 changes: 16 additions & 0 deletions 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 @@ -251,6 +251,22 @@ func nextGreaterElements(nums []int) []int {
}
```

### **TypeScript**
```ts
function nextGreaterElements(nums: number[]): number[] {
let stack: number[] = [], len = nums.length;
let res: number[] = new Array(len).fill(-1);
for (let i = 0; i < 2 * len - 1; i++) {
while (stack.length !== 0 && nums[stack[stack.length - 1]] < nums[i % len]) {
res[stack[stack.length - 1]] = nums[i % len];
stack.pop();
}
stack.push(i % len);
}
return res;
};
```

### **...**

```
Expand Down
16 changes: 16 additions & 0 deletions 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 @@ -239,6 +239,22 @@ func nextGreaterElements(nums []int) []int {
}
```

### **TypeScript**
```ts
function nextGreaterElements(nums: number[]): number[] {
let stack: number[] = [], len = nums.length;
let res: number[] = new Array(len).fill(-1);
for (let i = 0; i < 2 * len - 1; i++) {
while (stack.length !== 0 && nums[stack[stack.length - 1]] < nums[i % len]) {
res[stack[stack.length - 1]] = nums[i % len];
stack.pop();
}
stack.push(i % len);
}
return res;
};
```

### **...**

```
Expand Down
12 changes: 12 additions & 0 deletions solution/0500-0599/0503.Next Greater Element II/Solution.ts
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,12 @@
function nextGreaterElements(nums: number[]): number[] {
let stack: number[] = [], len = nums.length;
let res: number[] = new Array(len).fill(-1);
for (let i = 0; i < 2 * len - 1; i++) {
while (stack.length !== 0 && nums[stack[stack.length - 1]] < nums[i % len]) {
res[stack[stack.length - 1]] = nums[i % len];
stack.pop();
}
stack.push(i % len);
}
return res;
};