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

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

↳ Parent: MaximumSubarray

Complexity

Conditions	4
Paths	4

Size

Total Lines	15
Code Lines	9

Duplication

Lines	0
Ratio	0 %

Importance

Changes	2
Bugs	0	Features	0

Metric	Value
eloc	9
c	2
b	0
f	0
dl	0
loc	15
rs	9.9666
cc	4
nc	4
nop	1

<?php

declare(strict_types=1);

namespace leetcode;

class MaximumSubarray
{
    public static function maxSubArray(array $nums): int
    {
        if (empty($nums)) {
            return 0;
        }
        [$ans, $n] = [PHP_INT_MIN, count($nums)];
        for ($i = 0; $i < $n; $i++) {
            $sum = 0;
            for ($j = $i; $j < $n; $j++) {
                $sum += $nums[$j];
                $ans = max($ans, $sum);
            }
        }

        return $ans;
    }

    public static function maxSubArray2(array $nums): int
    {
        if (empty($nums)) {
            return 0;
        }

        [$ans, $sum] = [$nums[0], 0];
        foreach ($nums as $num) {
            $sum = max($sum + $num, $num);
            $ans = max($ans, $sum);
        }

        return $ans;
    }

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

        return max($dp);
    }
}


1			<?php
2
3			declare(strict_types=1);
4
5			namespace leetcode;
6
7			class MaximumSubarray
8			{
9			public static function maxSubArray(array $nums): int
10			{
11			if (empty($nums)) {
12			return 0;
13			}
14			[$ans, $n] = [PHP_INT_MIN, count($nums)];
15			for ($i = 0; $i < $n; $i++) {
16			$sum = 0;
17			for ($j = $i; $j < $n; $j++) {
18			$sum += $nums[$j];
19			$ans = max($ans, $sum);
20			}
21			}
22
23			return $ans;
24			}
25
26			public static function maxSubArray2(array $nums): int
27			{
28			if (empty($nums)) {
29			return 0;
30			}
31
32			[$ans, $sum] = [$nums[0], 0];
33			foreach ($nums as $num) {
34			$sum = max($sum + $num, $num);
35			$ans = max($ans, $sum);
36			}
37
38			return $ans;
39			}
40
41			public static function maxSubArray3(array $nums): int
42			{
43			if (empty($nums)) {
44			return 0;
45			}
46			$n = count($nums);
47			$dp = array_fill(0, $n, 0);
48			$dp[0] = $nums[0];
49			for ($i = 1; $i < $n; $i++) {
50			$dp[$i] = max($dp[$i - 1] + $nums[$i], $nums[$i]);
51			}
52
53			return max($dp);
54			}
55			}
56

imajinyun / leetcode-php

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

Complexity

Size

Duplication

Importance

Duplication Side-by-Side

Filter issues like

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