300. Longest Increasing Subsequence

300. Longest Increasing Subsequence

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

        return max(dp)