feat: add typescript solution to lc problem: No.0376.Wiggle Subsequence

Author: zhaocchen

solution/0300-0399/0376.Wiggle Subsequence/README.md

@@ -86,6 +86,23 @@ class Solution {
 }
 ```
 
+### **TypeScript**
+
+```ts
+function wiggleMaxLength(nums: number[]): number {
+    let up = 1, down = 1;
+    for (let i = 1; i < nums.length; ++i) {
+        let prev = nums[i - 1], cur = nums[i];
+        if (cur > prev) {
+            up = Math.max(up, down + 1);
+        } else if (cur < prev) {
+            down = Math.max(down, up + 1);
+        }
+    }
+    return Math.max(up, down);
+};
+```
+
 ### **C++**
 
 ```cpp

solution/0300-0399/0376.Wiggle Subsequence/README_EN.md

@@ -89,6 +89,23 @@ class Solution {
 }
 ```
 
+### **TypeScript**
+
+```ts
+function wiggleMaxLength(nums: number[]): number {
+    let up = 1, down = 1;
+    for (let i = 1; i < nums.length; ++i) {
+        let prev = nums[i - 1], cur = nums[i];
+        if (cur > prev) {
+            up = Math.max(up, down + 1);
+        } else if (cur < prev) {
+            down = Math.max(down, up + 1);
+        }
+    }
+    return Math.max(up, down);
+};
+```
+
 ### **C++**
 
 ```cpp

solution/0300-0399/0376.Wiggle Subsequence/Solution.ts

@@ -0,0 +1,12 @@
+function wiggleMaxLength(nums: number[]): number {
+    let up = 1, down = 1;
+    for (let i = 1; i < nums.length; ++i) {
+        let prev = nums[i - 1], cur = nums[i];
+        if (cur > prev) {
+            up = Math.max(up, down + 1);
+        } else if (cur < prev) {
+            down = Math.max(down, up + 1);
+        }
+    }
+    return Math.max(up, down);
+};