LeetCode 674. Longest Continuous Increasing Subsequence(java)

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.

我的方法就是走一遍，同时maintain一个最大值

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

follow up : 返回最长的子序列，年度最伤心的题目了，fb就是挂在这道题= 。 =，当时想复杂了，估计是脑子抽了吧、、、

    //follow up : return the max subarray
    public int[] findLengthOfLCIS(int[] nums) {
        //special case
        if (nums.length == 0 || nums.length == 1) return nums.length;
        //general case
        int max = 1, count = 1, start = 0, begin = 0, end = 0;
        for (int i = 0; i < nums.length - 1; i++) {
            if (nums[i] < nums[i + 1]) {
                count++;
                if (count > max) {
                    max = count;
                    begin = start;
                    end = i + 1;
                }
            } else {
                count = 1;
                start = i + 1;
            }
        }
        int index = 0;
        int[] result = new int[max];
        for (int i = begin; i <= end; i++) {
            result[index++] = nums[i];
        }
        return result;
    }