题目链接Leetcode_300-最长递增子序列关键词{% label 动态规划 green %}、{% label 数组 yellow %}解析状态定义：dp[i]：表示以 nums[i] 结尾的最长递增子序列的长度状态方程：nums[i] > nums[j]: dp[i] = dp[i] = dp[j] + 1nums[i] <= nums[j]: dp[i] = 1代码相似题目Leetcode_673-最长递增子序列的个数Author:CoderWddURL:https://www.wuinsights.top//article/c0c591b50339Copyright:All articles in this blog, except for special statements, adopt BY-NC-SA agreement. Please indicate the source!Relate PostsLeetcode 2923. 找到冠军 ILeetcode1026. 节点与其祖先之间的最大差值Leetcode 1702. 修改后的最大二进制字符串Leetcode 894. 所有可能的真二叉树Leetcode_64-最小路径和Leetcode_907-子数组的最小值之和Leetcode_1143-最长公共子序列Leetcode_53-最大子数组和
