feat: 300. Longest Increasing Subsequence

Author: gwbaik9717

longest-increasing-subsequence/gwbaik9717.js

@@ -0,0 +1,21 @@
+// n: len(nums)
+// Time complexity: O(n^2)
+// Space complexity: O(n)
+
+/**
+ * @param {number[]} nums
+ * @return {number}
+ */
+var lengthOfLIS = function (nums) {
+  const dp = Array.from({ length: nums.length }, () => 1);
+
+  for (let i = 1; i < nums.length; 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);
+};