class Solution:
"""
@param nums: An integer array
@return: The length of LIS (longest increasing subsequence)
"""
def longestIncreasingSubsequence(self, nums):
# write your code here
dp=[1 for i in range(len(nums))]
maxresult=0
for i in range(1,len(nums)):
for j in range(0,i):
if(nums[j]<nums[i]):
dp[i]=max(dp[i],dp[j]+1)
maxresult=max(dp[i],maxresult)
return maxresult
s = Solution()
print(s.longestIncreasingSubsequence([5,4,1,2,3]))
最长上升子序列
最新推荐文章于 2024-07-21 21:41:35 发布