class Solution {
public:
int lengthOfLIS(vector<int>& nums) {
if (nums.size() == 0) return 0;
vector<int> dp(nums.size(), 1);
int res = 1;
for (int i = 1; i < nums.size(); i++) {
int j = 0;
int tmp_max = 0;
for (; j < i; j++) {
if (nums[j] < nums[i]) {
tmp_max = max(tmp, dp[j]);
}
}
dp[j] = tmp_max + 1;
res = max(res, dp[j]);
}
return res;
}
};
最长上升子序列
最新推荐文章于 2024-12-18 21:14:43 发布
