LeetCode Longest Continuous Increasing Subsequence

原题链接在这里：https://leetcode.com/problems/longest-continuous-increasing-subsequence/

题目：

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.

题解：

如果当前值比前个值大就count++, 更新res. 否则count清回1.

Time Complexity: O(num.length).

Space: O(1).

AC Java:

 class Solution {
     public int findLengthOfLCIS(int[] nums) {
         if(nums == null || nums.length == 0){
             return 0;
         }

         int count = 1;
         int res = 1;
         for(int i = 1; i<nums.length; i++){
             if(nums[i] > nums[i-1]){
                 count++;
                 res = Math.max(res, count);
             }else{
                 count = 1;
             }
         }
         return res;
     }
 }

跟上Number of Longest Increasing Subsequence.