LeetCode674. Longest Continuous Increasing Subsequence

最新推荐文章于 2022-01-16 14:55:28 发布

mohk

最新推荐文章于 2022-01-16 14:55:28 发布

阅读量223

点赞数

分类专栏： leetcode 文章标签： c++ leetcode

本文链接：https://blog.csdn.net/mohuak/article/details/78076527

版权

leetcode 专栏收录该内容

51 篇文章 1 订阅

订阅专栏

LeetCode674. Longest Continuous Increasing Subsequence

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

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.

题意分析：这道题其实不算难，只要用两个参数max，cur去记录当前的长度和最长的长度，然后遍历一次就可以了，所需要的复杂度O(n)。

代码如下：

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