300. Longest Increasing Subsequence

class Solution:
    def lengthOfLIS(self, nums):
        """
        :type nums: List[int]
        :rtype: int
        """
        # dp[i]
        if not nums:
            return 0
        
        n = len(nums)
        dp = [1] * n    # dp[0]=1为初始条件，其他以1为初始值
        for i in range(1, n):   # 以第i个元素结尾
            for j in range(i):
                if nums[i] > nums[j] and dp[j] + 1 > dp[i]:
                    dp[i] = dp[j] + 1
                # else:
                #     dp[i] = 1
        
        return max(dp)