【Leetcode_easy】674. Longest Continuous Increasing Subsequence

problem

674. Longest Continuous Increasing Subsequence

solution

class Solution {

public:

    int findLengthOfLCIS(vector<int>& nums) {

        int res = , cnt = , cur = INT_MAX;

        for(auto num:nums)

        {

            if(num>cur) cnt++;

            else cnt = ;

            res = max(res, cnt);

            cur = num;

        }

        return res;

    }

};

solution2:

class Solution {

public:

    int findLengthOfLCIS(vector<int>& nums) {

        int res = , cnt = ;

        for(int i=; i<nums.size(); ++i)

        {

            if(i== || nums[i]>nums[i-]) res = max(res, ++cnt);

            else cnt = ;

        }

        return res;

    }

};

参考

1. Leetcode_easy_674. Longest Continuous Increasing Subsequence;

2. Grandyang;

完

巴特西

【Leetcode_easy】674. Longest Continuous Increasing Subsequence

最新文章

热门文章