题解 | #最长上升子序列(一)#

class Solution:
    def LIS(self , arr: List[int]) -> int:
        
        if len(arr)==0:
            return 0
            
        dp = [1 for i in range(len(arr))]

        for j in range(1,len(arr)):
            cans = [1]
            for k in range(0,j):
                if arr[j]>arr[k]:
                    cans.append(dp[k]+1)
            
            print(cans)
            dp[j] = max(cans)
            print(dp)
        
        return max(dp)