leetcode-674-Longest Continuous Increasing Subsequence

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. 

Input: [2,2,2,2,2]
Output: 1
Explanation: The longest continuous increasing subsequence is [2], its length is 1. 

    int findLengthOfLCIS(vector<int>& nums) 
    {
        int length=1,i=0,s1=nums.size(),max1=1;
        if(s1==0)
            return 0;
        while(i<s1-1)
        {
            if(nums[i]<nums[i+1])
            {
                length++;
                i++;
            }
            else
            {
                max1=max(max1,length);//记录大的长度
                i++;//i更新到下一个元素
                length=1;//重置length
            }
        }
        return max(max1,length);//当碰到类似于[1,3,5,7,9]的测试样例时
    }