[LC] 674. Longest Continuous Increasing Subsequence

Posted xuanlu

tags:

篇首语:本文由小常识网(cha138.com)小编为大家整理,主要介绍了[LC] 674. 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 == null || nums.length == 0) {
            return 0;
        }
        int cur = 1, res = 1;
        for (int i = 1; i < nums.length; i++) {
            if (nums[i] > nums[i - 1]) {
                cur += 1;
                res = Math.max(res, cur);
            } else {
                cur = 1;
            }        
        }
        return res;
    }
}

以上是关于[LC] 674. Longest Continuous Increasing Subsequence的主要内容,如果未能解决你的问题,请参考以下文章

674. Longest Continuous Increasing Subsequence

674. Longest Continuous Increasing Subsequence

674. Longest Continuous Increasing Subsequence

674. Longest Continuous Increasing Subsequence

674. Longest Continuous Increasing Subsequence

674. Longest Continuous Increasing Subsequence@python