feat: add ts solution to lc problem: No.0674

No.0674.Longest Continuous Increasing Subsequence

Author: YangFong

solution/0600-0699/0674.Longest Continuous Increasing Subsequence/README.md

@@ -156,6 +156,23 @@ func max(a, b int) int {
 }
 ```
 
+### **TypeScript**
+
+```ts
+function findLengthOfLCIS(nums: number[]): number {
+    const n = nums.length;
+    let res = 1;
+    let i = 0;
+    for (let j = 1; j < n; j++) {
+        if (nums[j - 1] >= nums[j]) {
+            res = Math.max(res, j - i);
+            i = j;
+        }
+    }
+    return Math.max(res, n - i);
+}
+```
+
 ### **...**
 
 ```

solution/0600-0699/0674.Longest Continuous Increasing Subsequence/README_EN.md

@@ -140,6 +140,23 @@ func max(a, b int) int {
 }
 ```
 
+### **TypeScript**
+
+```ts
+function findLengthOfLCIS(nums: number[]): number {
+    const n = nums.length;
+    let res = 1;
+    let i = 0;
+    for (let j = 1; j < n; j++) {
+        if (nums[j - 1] >= nums[j]) {
+            res = Math.max(res, j - i);
+            i = j;
+        }
+    }
+    return Math.max(res, n - i);
+}
+```
+
 ### **...**
 
 ```

solution/0600-0699/0674.Longest Continuous Increasing Subsequence/Solution.ts

@@ -0,0 +1,12 @@
+function findLengthOfLCIS(nums: number[]): number {
+    const n = nums.length;
+    let res = 1;
+    let i = 0;
+    for (let j = 1; j < n; j++) {
+        if (nums[j - 1] >= nums[j]) {
+            res = Math.max(res, j - i);
+            i = j;
+        }
+    }
+    return Math.max(res, n - i);
+}