674. Longest Continuous Increasing Subsequence

最新推荐文章于 2025-08-04 20:35:07 发布

原创最新推荐文章于 2025-08-04 20:35:07 发布 · 131 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#array #leetcode

本文探讨了如何在未排序整数数组中寻找最长连续递增子序列的问题。通过一个简洁的C++实现，我们展示了如何高效地找到该子序列的长度。示例包括[1,3,5,4,7]和[2,2,2,2,2]，并解释了连续递增的含义。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

674. Longest Continuous Increasing Subsequence

方法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.

方法1:

class Solution {
public:
    int findLengthOfLCIS(vector<int>& nums) {
        if (nums.empty()) return 0;
        int result = 1, count = 1;
        for (int i = 0; i < nums.size() - 1; i++) {
            if (nums[i + 1] > nums[i]) result = max(++count, result);
            else count = 1;
        }
        return result;
    }
};