- 描述:Given an unsorted array of integers, find the length of longest continuous increasing subsequence (subarray).
Example 1:
Input: [1,3,5,4,7]
Output: 3
Explanation: The longest continuous increasing subsequence is [1,3,5], its length is 3.
Even though [1,3,5,7] is also an increasing subsequence, it’s not a continuous one where 5 and 7 are separated by 4.
Example 2:
Input: [2,2,2,2,2]
Output: 1
Explanation: The longest continuous increasing subsequence is [2], its length is 1.
- 分析:题目中给出一个数组,要求找到这个数组的最大连续递增子串,并输出他的长度。
- 思路一:通过比较前后两个值的差来确定子串的状态,如果为正则为递增子串,给计数器加一,否则将计数器记为0。
class Solution {
public:
int findLengthOfLCIS(vector<int>& nums) {
if (nums.empty()) return 0;
int begin = 0;
int max_len = 1;
int temp = 1;
for (int i = 1; i < nums.size(); i++) {
if (nums[i] - nums[begin] > 0) {
temp++;
max_len = max(max_len, temp);
} else {
temp = 1;
}
begin++;
}
return max_len;
}
};