longest increasing subsequence solution

Author: hyer0705

longest-increasing-subsequence/hyer0705.ts

@@ -0,0 +1,14 @@
+function lengthOfLIS(nums: number[]): number {
+  const n = nums.length;
+  const dp: number[] = Array(n).fill(1);
+
+  for (let i = 1; 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);
+}