300.最长递增子序列

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