Skip to content

Commit 72885e3

Browse files
committed
update: 376
1 parent 1f233e6 commit 72885e3

File tree

2 files changed

+14
-1
lines changed

2 files changed

+14
-1
lines changed

README.md

+1-1
Original file line numberDiff line numberDiff line change
@@ -146,7 +146,7 @@ This is the solutions collection of my LeetCode submissions, most of them are pr
146146
| 350 | [Intersection of Two Arrays ii](https://leetcode.com/problems/intersection-of-two-arrays-ii/) | [JavaScript](./src/intersection-of-two-arrays-ii/res.js) | Easy |
147147
| 371 | [Sum of Two Integers](https://leetcode.com/problems/sum-of-two-integers/) | [JavaScript](./src/sum-of-two-integers/res.js) | Easy |
148148
| 374 | [Guess Number Higher or Lower](https://leetcode.com/problems/guess-number-higher-or-lower/) | [JavaScript](./src/guess-number-higher-or-lower/res.py) | Easy |
149-
| 376 | [Wiggle Subsequence](https://leetcode.com/problems/wiggle-subsequence/) | [JavaScript](./src/wiggle-subsequence/res.js) | Medium |
149+
| 376 | [Wiggle Subsequence](https://leetcode.com/problems/wiggle-subsequence/) | [JavaScript](./src/wiggle-subsequence/res.js) · [TypeScript](./src/wiggle-subsequence/res.ts) | Medium |
150150
| 384 | [Shuffle an Array](https://leetcode.com/problems/shuffle-an-array/) | [JavaScript](./src/shuffle-an-array/res.js) | Medium |
151151
| 395 | [Longest Substring with At Least K Repeating Characters](https://leetcode.com/problems/longest-substring-with-at-least-k-repeating-characters/) | [JavaScript](./src/longest-substring-with-at-least-k-repeating-characters/res.js) | Medium |
152152
| 404 | [Sum of Left Leaves](https://leetcode.com/problems/sum-of-left-leaves/) | [JavaScript](./src/sum-of-left-leaves/res.js) | Easy |

src/wiggle-subsequence/res.ts

+13
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,13 @@
1+
function wiggleMaxLength(nums: number[]): number {
2+
let up = 1, down = 1;
3+
4+
for (let i = 1; i < nums.length; i++) {
5+
if (nums[i] > nums[i-1]) {
6+
up = down + 1;
7+
} else if (nums[i] < nums[i-1]) {
8+
down = up + 1;
9+
}
10+
}
11+
12+
return Math.max(up, down);
13+
};

0 commit comments

Comments
 (0)