674. Longest Continuous Increasing Subsequence(Java)

注：此博客不再更新，所有最新文章将发表在个人独立博客limengting.site。分享技术，记录生活，欢迎大家关注

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.

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

优化后：

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