LongestContinuousIncreasingSubsequence::findLengthOfLCIS2() - Code Metrics - imajinyun/leetcode-php - Measure and Improve Code Quality continuously with Scrutinizer

findLengthOfLCIS2() A
last analyzed 2022-03-29 06:17 UTC

↳ Parent: LongestContinuousIncreasingSubsequence

Complexity

Conditions	4
Paths	4

Size

Total Lines	14
Code Lines	8

Duplication

Lines	0
Ratio	0 %

Importance

Changes	2
Bugs	0	Features	0

Metric	Value
eloc	8
c	2
b	0
f	0
dl	0
loc	14
rs	10
cc	4
nc	4
nop	1

<?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);
    }
}


1			<?php
2
3			declare(strict_types=1);
4
5			namespace leetcode;
6
7			class LongestContinuousIncreasingSubsequence
8			{
9			public static function findLengthOfLCIS(array $nums): int
10			{
11			if (empty($nums)) {
12			return 0;
13			}
14			$res = $cnt = 0;
15			for ($i = 0, $n = count($nums); $i < $n; $i++) {
16			if ($i === 0 \|\| $nums[$i] > $nums[$i - 1]) {
17			$res = max($res, ++$cnt);
18			} else {
19			$cnt = 1;
20			}
21			}
22
23			return $res;
24			}
25
26			public static function findLengthOfLCIS2(array $nums): int
27			{
28			if (empty($nums)) {
29			return 0;
30			}
31			$n = count($nums);
32			$dp = array_fill(0, $n, 1);
33			for ($i = 1; $i < $n; $i++) {
34			if ($nums[$i] > $nums[$i - 1]) {
35			$dp[$i] = $dp[$i - 1] + 1;
36			}
37			}
38
39			return max($dp);
40			}
41			}
42

imajinyun / leetcode-php

findLengthOfLCIS2() A last analyzed 2022-03-29 06:17 UTC

Complexity

Size

Duplication

Importance

Duplication Side-by-Side

Filter issues like

findLengthOfLCIS2() A
last analyzed 2022-03-29 06:17 UTC