首页 > itarticle > algorithm notes: leetcode#674 longest continuous increasing subsequence

algorithm notes: leetcode#674 longest continuous increasing subsequence

admin 11月 12, 2020 0

Problem

Analysis

Solution

Python implementation

class :
    def findLengthOfLCIS(self, nums):
        """
        :type nums: List[int]
        :rtype: int
        """
        max_len = 0
        cur_len = 0
        prev = float("-inf")
        for num in nums:
            if num > prev:
                cur_len += 1
            else:
                max_len = max(cur_len, max_len)
                cur_len = 1
            prev = num
        return max(max_len, cur_len)

Java implementation

class  {
    public int findLengthOfLCIS(int[] nums) {
        int maxLen = 0;
        int curLen = 0;
        int prev = 0;
        for(int num : nums){
            if(num > prev){
                curLen ++;
            }else{
                maxLen = maxLen > curLen ? maxLen : curLen;
                curLen = 1;
            }
            prev = num;
        }
        return maxLen > curLen ? maxLen : curLen;
    }
}

Time complexity

O(n).

Space complexity

O(1).

Link

674. Longest Continuous Increasing Subsequence
(中文版) 算法笔记: 力扣#674 最长连续递增序列