Longest Continuous Increasing Subsequence

题目
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.

答案

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