674. Longest Continuous Increasing Subsequence

Given an unsorted array of integers, find the length of longest continuous increasing subsequence.

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. 

在未排序的数组中，找出最长递增序列的长度

c++(16ms):

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