Time: 1487 ms (74.00%), Space: 16.8 MB (18.71%) - LeetHub

Author: birdieHyun

Diff for: 0300-longest-increasing-subsequence/0300-longest-increasing-subsequence.py

@@ -0,0 +1,16 @@
+class Solution:
+    def lengthOfLIS(self, nums: List[int]) -> int:
+
+        dp = [0] * (len(nums) + 1)
+
+        for i in range(len(nums)):
+            maximum = 0
+
+            for j in range(i):
+
+                if nums[i] > nums[j] and dp[j] > maximum:
+                    maximum = dp[j]
+
+            dp[i] = maximum + 1
+
+        return max(dp)