标签：code ogr length for min col return range sub
不会。。。
参考：
思路类似于coin那个题，for循环中在满足条件时就及时更新当下位置的信息
def lengthOfLIS(nums): """ :type nums: List[int] :rtype: int """ if nums==[]: return 0 N = len(nums) Dp = [1]*N print(N,Dp) for i in range(N-1): for j in range(0,i+1): if nums[i+1]>nums[j]: Dp[i+1] = max(Dp[i+1],Dp[j]+1) return max(Dp)
leetcode-mid-dynamic programming- Longest Increasing Subsequence-NO
标签：code ogr length for min col return range sub
原文地址：https://www.cnblogs.com/rosyYY/p/10981394.html
