[Leetcode] 674. Longest Continuous Increasing Subsequence 解题报告

魔豆Magicbean

于 2018-01-31 10:25:20 发布

阅读量219

点赞数

CC 4.0 BY-SA版权

分类专栏： IT公司面试习题文章标签： Leetcode 解题报告 Array

本文链接：https://blog.youkuaiyun.com/magicbean2/article/details/79213913

IT公司面试习题专栏收录该内容

736 篇文章

订阅专栏

本文介绍了一种寻找给定整数数组中最长连续递增子序列的方法，并提供了详细的示例与实现代码。

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

题目：

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;
        }
        int len = 1, max_len = 1;
        for (int i = 1; i < nums.size(); ++i) {
            if (nums[i] > nums[i - 1]) {
                ++len;
                max_len = max(max_len, len);
            }
            else {
                len = 1;
            }
        }
        return max_len;
    }
};