# 题目
# https://leetcode.cn/problems/longest-increasing-subsequence/
# 参考链接
# https://blog.csdn.net/anan15151529/article/details/118162225
# 题解
# https://leetcode.cn/problems/longest-increasing-subsequence/solution/zui-chang-shang-sheng-zi-xu-lie-dong-tai-gui-hua-2/
class Solution(object):
def lengthOfLIS(self, nums):
"""
:type nums: List[int]
:rtype: int
"""
# if not nums:
# return 0
n = len(nums)
dp = [1 for _ in range(n)]
for i in range(n):
for j in range(i):
if nums[i] > nums[j]:
dp[i] = max(dp[i], dp[j]+1)
return max(dp)
力扣300.最长递增子序列(python版本)——DP
于 2022-05-10 22:08:25 首次发布