leetcode 674. Longest Continuous Increasing Subsequence 最长递增连续子序列

￡神魔★判官ぃ 2022-06-03 08:19 170阅读 0赞

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.

本题题意很简单，就是寻找连续的递增序列，注意是连续的，所以直接遍历即可

建议和[leetcode 673. Number of Longest Increasing Subsequence 动态规划DP][leetcode 673. Number of Longest Increasing Subsequence _DP] 一起学习

代码如下：

#include <iostream>
    #include <vector>
    #include <map>
    #include <set>
    #include <queue>
    #include <stack>
    #include <string>
    #include <climits>
    #include <algorithm>
    #include <sstream>
    #include <functional>
    #include <bitset>
    #include <numeric>
    #include <cmath>
    #include <regex>
    
    using namespace std;
    
    
    class Solution 
    {
    public:
        int findLengthOfLCIS(vector<int>& nums) 
        {
            if (nums.size() <= 1)
                return nums.size();
    
            int res = 1, curLen = 1;
            for(int i=1;i<nums.size();i++)
            {
                if (nums[i] > nums[i - 1])
                    curLen++;
                else
                    curLen = 1;
                res = max(res, curLen);
            }
            return res;
        }
    };

[leetcode 673. Number of Longest Increasing Subsequence _DP]: http://blog.csdn.net/jackzhang_123/article/details/78870425