最长递增子序列

def solve():
    def lengthOfLIS(____):
        if not nums:
            return ____
        dp = [____] * len(____)
        for i in range(____, len(____)):
            for j in range(____):
                if nums[i] > nums[j]:
                    dp[i] = max(____)
        return max(____)
    print(lengthOfLIS(____))