longest increasing subsequence

Author: daiyongg-kim

longest-increasing-subsequence/daiyongg-kim.py

@@ -0,0 +1,14 @@
+class Solution:
+    def lengthOfLIS(self, nums: List[int]) -> int:
+        if not nums:
+            return 0
+        
+        # 모든 위치에서 최소 길이는 1 (자기 자신)
+        dp = [1] * len(nums)
+        
+        for i in range(len(nums)):
+            for j in range(i):
+                if nums[i] > nums[j]:
+                    dp[i] = max(dp[i], dp[j] + 1)
+        
+        return max(dp)