ElementUI el-tree 树组件 增加辅助线

class Solution:
    def longest_substring_dp(self, nums):
        length = len(nums)
        dp = [1] * length
        for i in range(1, length):
            for j in range(i):
                if nums[i] > nums[j]:
                    dp[i] = max(dp[i], dp[j] + 1)
        return max(dp)
if __name__ == '__main__':
    num = eval(input())
    solution = Solution()
    print(solution.longest_substring_dp(num))

仅作为代码记录，方便自学自查自纠