代码随想录：最长连续递增序列

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