leetCode-Longest Continuous Increasing Subsequence

Description:
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. 

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

My Solution:

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

总结:注意用count来计数就可以了，如果nums[i+1]>nums[i],count++,否则,count置为1,如果count>max,max更新,最后，返回的时候需要注意用Math.max(count,max),因为有可能count一直递增，还没与max比较就退出循环了。

版权声明：本文为博主原创文章，未经博主允许不得转载。

转载于:https://www.cnblogs.com/kevincong/p/7887613.html