leetcode\LongestContinuousIncreasingSubsequence

Complexity

Total Complexity

9

Size/Duplication

Total Lines	33
Duplicated Lines	0 %

Importance

Changes	2
Bugs	0	Features	0

2 Methods

Rating	Name	Duplication	Size	Complexity
A	findLengthOfLCIS2()	0	14	4
A	findLengthOfLCIS()	0	15	5

<?php

declare(strict_types=1);

namespace leetcode;

class LongestContinuousIncreasingSubsequence
{
    public static function findLengthOfLCIS(array $nums): int
    {
        if (empty($nums)) {
            return 0;
        }
        $res = $cnt = 0;
        for ($i = 0, $n = count($nums); $i < $n; $i++) {
            if ($i === 0 || $nums[$i] > $nums[$i - 1]) {
                $res = max($res, ++$cnt);
            } else {
                $cnt = 1;
            }
        }

        return $res;
    }

    public static function findLengthOfLCIS2(array $nums): int
    {
        if (empty($nums)) {
            return 0;
        }
        $n = count($nums);
        $dp = array_fill(0, $n, 1);
        for ($i = 1; $i < $n; $i++) {
            if ($nums[$i] > $nums[$i - 1]) {
                $dp[$i] = $dp[$i - 1] + 1;
            }
        }

        return max($dp);
    }
}