674. Longest Continuous Increasing Subsequence。

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.

• Note: Length of the array will not exceed 10,000.

class Solution {
public:
int findLengthOfLCIS(vector<int>& nums) {

int n = nums.size();

if(n <= 1) {
return n;
}

int maxNum = 1;//记录出现最大连续值
int count = 1;//记录当前连续出现的次数

for(int i=1; i < n; i++) {
//cout << nums[i-1] << "," << nums[i] << endl;
if(nums[i-1] < nums[i]) {//如果比当前的小就是递增
count++;
} else {
count = 1;
}
maxNum = max(count,maxNum);
}
return maxNum;
}
};

class Solution {
public:
int findLengthOfLCIS(vector<int>& nums) {
int maxLen = 0;//最大的连续次数
int curIndex = 0;//当前的下标

for(int i=0;i<nums.size();i++) {
if(i>0 && nums[i] <= nums[i-1]) {//从第二个开始，记录下递增序列开始的位置
curIndex = i;//记录当前的下标
}
maxLen = max(maxLen,i-curIndex+1);//用当前的最长连续次数和当前的连续次数
}
return maxLen;
}
};