674. Longest Continuous Increasing Subsequence

O(n)

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