LeetCode - 300. Longest Increasing Subsequence using DP

300. Longest Increasing Subsequence.swift

final class Solution {
  func lengthOfLIS(_ nums: [Int]) -> Int {

    var dp: [Int] = .init(repeating: 1, count: nums.count)

    for i in 1..<nums.count {
      for j in 0..<i where dp[i] <= dp[j] && nums[j] < nums[i] {
        dp[i] = dp[j] + 1
      }
    }

    return dp.max() ?? 1
  }
}