LeetCode674. 最长连续递增序列

题目

代码

线性dp

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

贪心

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