class Solution {
public:
int findLengthOfLCIS(vector<int>& nums) {
/*
dp[i] : 以下标i为结尾的最长连续递增子序列的长度
dp[i] = dp[i - 1] + 1;
*/
if (nums.size() == 0) return 0;
int result = 1;
vector<int> dp(nums.size() ,1);
for (int i = 1; i < nums.size(); i++) {
if (nums[i] > nums[i - 1]) {
dp[i] = dp[i - 1] + 1;
}
if (dp[i] > result) result = dp[i]; //记录最长的那个dp[i]
}
return result;
}
};
<Talk is cheap, show me the code 22> LeetCode.674 最长连续递增序列
于 2024-07-06 18:28:39 首次发布