longest-increasing-subsequence solved

Author: hsskey

longest-increasing-subsequence/hsskey.js

@@ -0,0 +1,16 @@
+/**
+ * @param {number[]} nums
+ * @return {number}
+ */
+var lengthOfLIS = function(nums) {
+    const lis = new Array(nums.length).fill(1);
+
+    for(let i = nums.length - 2; i >= 0; i--) {
+        for(let j = i + 1; j < nums.length; j++) {
+            if(nums[i] < nums[j]) {
+                lis[i] = Math.max(lis[i], 1 + lis[j])
+            }
+        }
+    }
+    return Math.max(...lis)
+};