Longest Continuous Increasing Subsequence 问题及解法

最新推荐文章于 2023-09-01 12:41:13 发布

我们要爱学习

最新推荐文章于 2023-09-01 12:41:13 发布

阅读量310

点赞数

分类专栏： LeetCode算法练习（Easy）文章标签： LeetCode Easy

本文链接：https://blog.csdn.net/u011809767/article/details/77932589

版权

LeetCode算法练习（Easy）专栏收录该内容

156 篇文章 3 订阅

订阅专栏

问题描述：

Given an unsorted array of integers, find the length of longest continuous increasing subsequence.

示例:

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.

Input: [2,2,2,2,2]
Output: 1
Explanation: The longest continuous increasing subsequence is [2], its length is 1.

问题分析：

求解出所有递增的连续子序列，取其中最长的即可。

过程详见代码：

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