LeetCode 674. Longest Continuous Increasing Subsequence

class Solution {
public:
    int findLengthOfLCIS(vector<int>& nums) {
        int ans = 0, l = 0;
        for (int r = 0; r < nums.size(); ++r) {
            if (r > 0 && nums[r] <= nums[r - 1])
                l = r;
            ans = max(ans, r - l + 1);
        }
        return ans;
    }
};