Longest Continuous Increasing Subsequence

版权声明：本文为博主原创文章，未经博主允许不得转载。 https://blog.csdn.net/wuqingdeqing/article/details/80661609

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

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.

LeetCode 674题，查找数组中最大的递增子序列。Accepted代码如下：

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

有两处较易出现失误，一处是max的初始值，若设定为0，则所有元素相同时会出现错误；还有一处就是空数组时，此情况应覆盖。