Create 300.最长上升子序列.js

Author: yinxin630

300.最长上升子序列.js

@@ -0,0 +1,22 @@
+/**
+ * @param {number[]} nums
+ * @return {number}
+ */
+var lengthOfLIS = function(nums) {
+    if (nums.length <= 1) {
+        return nums.length;
+    }
+
+    const dp = [1];
+    let result = 0;
+    for (let i = 1; i < nums.length; i++) {
+        dp[i] = 1;
+        for (let j = 0; j < i; j++) {
+            if (nums[j] < nums[i]) {
+                dp[i] = Math.max(dp[i], dp[j] + 1);
+            }
+        }
+        result = Math.max(result, dp[i]);
+    }
+    return result;
+};