 # [LeetCode] 674. 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 , its length is 1.


Note: Length of the array will not exceed 10,000.

class Solution {
public:
int findLengthOfLCIS(vector<int>& nums) {
int res = 0, cnt = 0, cur = INT_MAX;
for (int num : nums) {
if (num > cur) ++cnt;
else cnt = 1;
res = max(res, cnt);
cur = num;
}
return res;
}
};

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

Github 同步地址：

https://github.com/grandyang/leetcode/issues/674

Number of Longest Increasing Subsequence

Minimum Window Subsequence

https://leetcode.com/problems/longest-continuous-increasing-subsequence/

https://leetcode.com/problems/longest-continuous-increasing-subsequence/discuss/107352/Java-code-6-liner

https://leetcode.com/problems/longest-continuous-increasing-subsequence/discuss/107365/JavaC%2B%2BClean-solution

LeetCode All in One 题目讲解汇总(持续更新中...)

 微信打赏 Venmo 打赏 posted @ 2017-09-28 22:30  Grandyang  阅读(4534)  评论(0编辑  收藏  举报 