feat: add typescript solution to lc problem: No.0300.Longest Increasing Subsequence

Author: zhaocchen

solution/0300-0399/0300.Longest Increasing Subsequence/README.md

@@ -107,6 +107,23 @@ class Solution {
 }
 ```
 
+### **TypeScript**
+
+```ts
+function lengthOfLIS(nums: number[]): number {
+    let n = nums.length;
+    let dp = new Array(n).fill(1);
+    for (let i = 0; i < n; i++) {
+        for (let j = 0; j < i; j++) {
+            if (nums[j] < nums[i]) {
+                dp[i] = Math.max(dp[i], dp[j] + 1);
+            }
+        }
+    }
+    return Math.max(...dp);
+};
+```
+
 ### **C++**
 
 ```cpp

solution/0300-0399/0300.Longest Increasing Subsequence/README_EN.md

@@ -91,6 +91,23 @@ class Solution {
 }
 ```
 
+### **TypeScript**
+
+```ts
+function lengthOfLIS(nums: number[]): number {
+    let n = nums.length;
+    let dp = new Array(n).fill(1);
+    for (let i = 0; i < n; i++) {
+        for (let j = 0; j < i; j++) {
+            if (nums[j] < nums[i]) {
+                dp[i] = Math.max(dp[i], dp[j] + 1);
+            }
+        }
+    }
+    return Math.max(...dp);
+};
+```
+
 ### **C++**
 
 ```cpp

solution/0300-0399/0300.Longest Increasing Subsequence/Solution.ts

@@ -0,0 +1,12 @@
+function lengthOfLIS(nums: number[]): number {
+    let n = nums.length;
+    let dp = new Array(n).fill(1);
+    for (let i = 0; i < n; i++) {
+        for (let j = 0; j < i; j++) {
+            if (nums[j] < nums[i]) {
+                dp[i] = Math.max(dp[i], dp[j] + 1);
+            }
+        }
+    }
+    return Math.max(...dp);
+};