class Solution {
public:
int lengthOfLIS(vector<int>& nums) {
vector<int> dp(nums.size(), 1);
int maxLength = 1;
for (int i = 1; i < nums.size(); i++) {
for (int j = 0; j < i; j++) {
if (nums[i] > nums[j])
dp[i] = max(dp[i], dp[j] + 1);
}
if (dp[i] > maxLength)
maxLength = dp[i];
}
return maxLength;
}
};
LeetCode300.最长递增子序列
最新推荐文章于 2024-07-13 13:36:16 发布