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

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

↳ Parent: FindPivotIndex

Complexity

Conditions	4
Paths	4

Size

Total Lines	14
Code Lines	7

Duplication

Lines	0
Ratio	0 %

Importance

Changes	2
Bugs	0	Features	0

Metric	Value
eloc	7
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 FindPivotIndex
{
    public static function pivotIndex(array $nums): int
    {
        if (empty($nums)) {
            return 0;
        }
        [$left, $right] = [0, array_sum($nums)];
        foreach ($nums as $key => $num) {
            $right -= $num;
            if ($left === $right) {
                return $key;
            }
            $left += $num;
        }

        return -1;
    }

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

        [$n, $sum, $total] = [count($nums), 0, array_sum($nums)];
        for ($i = 0; $i < $n; $sum += $nums[$i++]) {
            if ($sum * 2 === $total - $nums[$i]) {
                return $i;
            }
        }

        return -1;
    }

    public static function pivotIndex3(array $nums): int
    {
        if (empty($nums)) {
            return 0;
        }
        [$n, $sum, $total] = [count($nums), 0, array_sum($nums)];
        for ($i = 0; $i < $n; $i++) {
            if ($i !== 0) {
                $sum += $nums[$i - 1];
            }
            if ($total - $sum - $nums[$i] === $sum) {
                return $i;
            }
        }

        return -1;
    }
}


1			<?php
2
3			declare(strict_types=1);
4
5			namespace leetcode;
6
7			class FindPivotIndex
8			{
9			public static function pivotIndex(array $nums): int
10			{
11			if (empty($nums)) {
12			return 0;
13			}
14			[$left, $right] = [0, array_sum($nums)];
15			foreach ($nums as $key => $num) {
16			$right -= $num;
17			if ($left === $right) {
18			return $key;
19			}
20			$left += $num;
21			}
22
23			return -1;
24			}
25
26			public static function pivotIndex2(array $nums): int
27			{
28			if (empty($nums)) {
29			return 0;
30			}
31
32			[$n, $sum, $total] = [count($nums), 0, array_sum($nums)];
33			for ($i = 0; $i < $n; $sum += $nums[$i++]) {
34			if ($sum * 2 === $total - $nums[$i]) {
35			return $i;
36			}
37			}
38
39			return -1;
40			}
41
42			public static function pivotIndex3(array $nums): int
43			{
44			if (empty($nums)) {
45			return 0;
46			}
47			[$n, $sum, $total] = [count($nums), 0, array_sum($nums)];
48			for ($i = 0; $i < $n; $i++) {
49			if ($i !== 0) {
50			$sum += $nums[$i - 1];
51			}
52			if ($total - $sum - $nums[$i] === $sum) {
53			return $i;
54			}
55			}
56
57			return -1;
58			}
59			}
60

imajinyun / leetcode-php

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

Complexity

Size

Duplication

Importance

Duplication Side-by-Side

Filter issues like

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