LeetCode #674 - Longest Continuous Increasing Subsequence

最新推荐文章于 2024-04-11 22:23:18 发布

LawFile

最新推荐文章于 2024-04-11 22:23:18 发布

阅读量94

点赞数

分类专栏： LeetCode

本文链接：https://blog.csdn.net/LawFile/article/details/86684542

版权

LeetCode 专栏收录该内容

625 篇文章 1 订阅

订阅专栏

题目描述：

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(vector<int>& nums) {
        if(nums.size()==0) return 0;
        vector<int> dp(nums.size(),1);
        int pre_length=1;
        int max_length=1;
        for(int i=1;i<nums.size();i++)
        {
            int cur_length=pre_length;
            if(nums[i]>nums[i-1]) cur_length++;
            else cur_length=1;
            max_length=max(max_length, cur_length);
            pre_length=cur_length;
        }
        return max_length;
    }
};