题目
674. Longest Continuous Increasing Subsequence
解题思路
- 长度<2的,返回1
- 长度≥2的,用一个标记increase记录当前升序数组的长度,直到升序停止,再与先前最长升序数组的长度比较取最大
具体代码
class Solution {
public:
int findLengthOfLCIS(vector<int>& nums) {
if (nums.size() < 2) return nums.size();
int continus = 1, max_continus = 1;
int increase = 1;
for (int i = 1; i < nums.size(); i++) {
if (nums[i] > nums[i-1]) {
++increase;
}
else {
max_continus = max_continus > increase ? max_continus : increase;
increase = 1;
}
}
return max_continus > increase ? max_continus : increase;
}
};