Leetcode 674. Longest Continuous Increasing Subsequence

Find the length of the longest contiguous (continuous) strictly increasing subarray in a given integer array. This is typically solved by a single-pass/sweeping-window scan that tracks the current increasing run and the maximum length (O(n) time, O(1) extra space).