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

class Solution:
    def LIS(self , arr: List[int]) -> int:
        # write code here
        if not arr:
            return 0
        
        dp = [1 for _ in range(len(arr))]

        for i in range(len(arr)):
            for j in range(i):
                if arr[i] > arr[j]:
                    dp[i] = max(dp[i], dp[j]+1)
        
        return max(dp)