LeetCode每天刷day35:Longest Continuous Increasing Subsequence

版权声明：本文为博主原创文章，未经博主允许可以转载。（转呀转呀/笑哭），希望标注出处hhh https://blog.csdn.net/qq_36428171/article/details/89420916

题目:
给定一个未经排序的整数数组，找到最长且连续的的递增序列。

题目链接:Longest Continuous Increasing Subsequence
C++:

class Solution {
public:
    int findLengthOfLCIS(vector<int>& nums) {
        if(nums.size() == 0 || nums.size() == 1) 
            return nums.size();
        int res = 0;
        int cnt = 1;
        for(auto itr1 = nums.begin(), itr2 = nums.begin() + 1; itr2 != nums.end();itr2++){
            if(*itr1 < *itr2 && itr2 != nums.end()){
                cnt++;
            }
            else
                cnt = 1;
            if(res < cnt)
                res = cnt;
            itr1 = itr2;
        }
        return res;
    }
};