【Leetcode_easy】674. Longest Continuous Increasing Subsequence

problem

674. Longest Continuous Increasing Subsequence

solution

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

solution2:

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

 

参考

1. Leetcode_easy_674. Longest Continuous Increasing Subsequence;

2. Grandyang;

完