最长上升子序列300

dp[i]表示一定将i纳入最长子序列时最长子序列的长度

if nums[i] > nums[j]:
 dp[i] = max(dp[i], dp[j] +1)

class :
    def lengthOfLIS(self, nums):
        """
        :type nums: List[int]
        :rtype: int
        """
        if not nums:
            return 0
        
        n = len(nums)
        dp = [1 for x in range(n)]
        for i in range(n):
            for j in range(i):
                if nums[i] > nums[j]:
                    dp[i] = max(dp[i], dp[j] + 1)
        return max(dp)

# 例子
a = [10, 9, 2, 5, 3, 7, 101, 18]
print(Solution().lengthOfLIS(a))