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.

---

方法1：遍历数组，记录最大长度和当前长度

Tips：在当前递增结束、遍历结束后都要更新最大长度

class Solution {
public:
    int findLengthOfLCIS(vector<int>& nums) {
        int n=nums.size();
        if(n==0) return 0;
        int maxNum=1;
        int cur=1;
        for(int i=1;i<n;i++){
            if(nums[i]>nums[i-1]){
                cur++;
            }else{
                maxNum=max(maxNum,cur);
                cur=1;
            }
        }
        maxNum=max(maxNum,cur);
        return maxNum;
    }
};