Longest-Continuous-Increasing-Subsequence

发表于 | 更新于：

题目地址

LeetCode#674 Longest Continuous Increasing Subsequence

题目描述

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

Example 1:

1
2
3
4
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:

1
2
3
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.

解题思路

  直接遍历，当连续增长中断的时候更新最大值。

解题代码

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
class Solution {
public:
    int findLengthOfLCIS(vector<int>& nums) {
        if (nums.empty()) return 0;
        int res = 1 , cot = 1;
        for (int i = 1; i < nums.size(); ++i) {
            if(nums[i] > nums[i-1]) cot++;
            else {
                res = max(cot , res);
                cot = 1;
            }
        }
        res = max(cot , res);
        return res;
    }
};
0%