#NC91 最长递增子序列 # retrun the longest increasing subsequence # @param arr int整型一维数组 the array # @return int整型一维数组 # class Solution: def LIS(self , arr ): # write code here """ # 1. 动态规划,超时 if len(arr) < 2: return arr dp ...