［LeetCode］Longest Continuous Increasing Subsequence 最长连续增长序列 ［LeetCode］Longest Continuous Incr

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. 

class Solution {
    public int findLengthOfLCIS(int[] nums) {
        if(nums.length <=1)
            return nums.length;
        int res = 0;
        int flag = 0;
        for(int i=0; i<nums.length; i++)
            if(i==0 || nums[i]>nums[i-1])
                res = Math.max(res, ++flag);
            else
                flag = 1;
        return res;
    }
}