674. Longest Continuous Increasing Subsequence

本文主要是介绍674. Longest Continuous Increasing Subsequence，对大家解决编程问题具有一定的参考价值，需要的程序猿们随着小编来一起学习吧！

Given an unsorted array of integers nums, return the length of the longest continuous increasing subsequence (i.e. subarray). The subsequence must be strictly increasing.

A continuous increasing subsequence is defined by two indices l and r (l < r) such that it is [nums[l], nums[l + 1], ..., nums[r - 1], nums[r]] and for each l <= i < r, nums[i] < nums[i + 1].

Example 1:

Input: nums = [1,3,5,4,7]
Output: 3
Explanation: The longest continuous increasing subsequence is [1,3,5] with length 3.
Even though [1,3,5,7] is an increasing subsequence, it is not continuous as elements 5 and 7 are separated by element
4.

Example 2:

Input: nums = [2,2,2,2,2]
Output: 1
Explanation: The longest continuous increasing subsequence is [2] with length 1. Note that it must be strictly
increasing.

Constraints:

• 1 <= nums.length <= 104
• -109 <= nums[i] <= 109

class Solution {
    public int findLengthOfLCIS(int[] nums) {
        int cur = 1, res = 1;
        for(int r = 1; r < nums.length; r++) {
            if(nums[r] > nums[r - 1]) {
                cur++;
                res = Math.max(res, cur);
            }
            else cur = 1;
        }
        return res;
    }
}

这篇关于674. Longest Continuous Increasing Subsequence的文章就介绍到这儿，希望我们推荐的文章对大家有所帮助，也希望大家多多支持为之网！