LeetCode 300. 最长递增子序列

示例 1：

输入：nums = [10,9,2,5,3,7,101,18]
输出：4
解释：最长递增子序列是 [2,3,7,101]，因此长度为 4 。
示例 2：

输入：nums = [0,1,0,3,2,3]
输出：4
示例 3：

输入：nums = [7,7,7,7,7,7,7]
输出：1

class Solution:
    def lengthOfLIS(self, nums: List[int]) -> int:
        length = len(nums)
        dp = [1] * length
        for i in range(length):
            for j in range(i):
                # print(nums[i],nums[j],dp)
                if nums[j] < nums[i]:
                    dp[i] = max(dp[i],dp[j]+1)
        # print(dp)
        return max(dp)

if __name__ == '__main__':
    nums = [10,9,2,5,3,7,101,18]
    nums = [0, 1, 0, 3, 2, 3]
    # nums = [7, 7, 7, 7, 7, 7, 7]
    nums = [1,3,6,7,9,4,10,5,6]
    res = Solution().lengthOfLIS(nums)
    print(res)