Solution Longest increasing subsequence

Author: doitduri

longest-increasing-subsequence/doitduri.swift

@@ -0,0 +1,20 @@
+class Solution {
+    func lengthOfLIS(_ nums: [Int]) -> Int {
+        if nums.isEmpty {
+            return 0
+        }
+        
+        let n = nums.count
+        var dp = Array(repeating: 1, count: n)
+        
+        for i in 1..<n {
+            for j in 0..<i {
+                if nums[i] > nums[j] {
+                    dp[i] = max(dp[i], dp[j] + 1)
+                }
+            }
+        }
+        
+        return dp.max() ?? 1
+    }
+}