LeetCode 674. Longest Continuous Increasing Subsequence

Question

Given an unsorted array of integers nums, return the length of the longest continuous increasing subsequence (i.e. subarray). The subsequence must be strictly increasing.

A continuous increasing subsequence is defined by two indices l and r (l < r) such that it is [nums[l], nums[l + 1], ..., nums[r - 1], nums[r]] and for each l <= i < r, nums[i] < nums[i + 1].

Code

class Solution {
    fun findLengthOfLCIS(nums: IntArray): Int {
        var subSeqLen = 1
        var tmp = 1
        for (idx in 1..nums.lastIndex) {
            if (nums[idx -1] < nums[idx]) {
                tmp++
                if (subSeqLen < tmp) subSeqLen = tmp
            } else {
                tmp = 1
            }
        }
        return subSeqLen
    }
}

Profile

Submission