Merge pull request youngyangyang04#1349 from xiaofei-2020/dp41

添加（0300.最长上升子序列.md）：增加typescript版本

problems/0300.最长上升子序列.md

@@ -237,6 +237,27 @@ const lengthOfLIS = (nums) => {
 };
 ```
 
+TypeScript
+
+```typescript
+function lengthOfLIS(nums: number[]): number {
+    /**
+        dp[i]: 前i个元素中，以nums[i]结尾，最长子序列的长度
+     */
+    const dp: number[] = new Array(nums.length).fill(1);
+    let resMax: number = 0;
+    for (let i = 0, length = nums.length; i < length; i++) {
+        for (let j = 0; j < i; j++) {
+            if (nums[i] > nums[j]) {
+                dp[i] = Math.max(dp[i], dp[j] + 1);
+            }
+        }
+        resMax = Math.max(resMax, dp[i]);
+    }
+    return resMax;
+};
+```
+