DistanceBetweenBusStops::distanceBetweenBusStops2() - Code Metrics - Inspection of "Add day-of-the-week solution" - imajinyun/leetcode-php - Measure and Improve Code Quality continuously with Scrutinizer

Test Failed

Push — master ( c19dce...c10a28 )

by Jinyun

created 2021-06-05 12:03 UTC

distanceBetweenBusStops2() A

↳ Parent: DistanceBetweenBusStops

Complexity

Conditions	4
Paths	2

Size

Total Lines	9
Code Lines	5

Duplication

Lines	0
Ratio	0 %

Importance

Changes	1
Bugs	0	Features	0

Metric	Value
eloc	5
c	1
b	0
f	0
dl	0
loc	9
rs	10
cc	4
nc	2
nop	3

<?php

declare(strict_types=1);

namespace leetcode;

class DistanceBetweenBusStops
{
    public static function distanceBetweenBusStops(array $distance, int $start, int $destination): int
    {
        if (empty($distance) || $start < 0 || $destination < 0) {
            return 0;
        }
        if ($start > $destination) {
            $tmp = $start;
            $start = $destination;
            $destination = $tmp;
        }
        $res = $sum = 0;
        foreach ($distance as $i => $value) {
            if ($i >= $start && $i < $destination) {
                $res += $value;
            }
            $sum += $value;
        }

        return min($res, $sum - $res);
    }

    public static function distanceBetweenBusStops2(array $distance, int $start, int $destination): int
    {
        if (empty($distance) || $start < 0 || $destination < 0) {
            return 0;
        }
        [$a, $b] = [min($start, $destination), max($start, $destination)];
        $slice = array_slice($distance, $a, $b - $a);

        return min(array_sum($slice), array_sum($distance) - array_sum($slice));
    }

    public static function distanceBetweenBusStops3(array $distance, int $start, int $destination): int
    {
        if (empty($distance) || $start < 0 || $destination < 0) {
            return 0;
        }
        [$a, $b, $n] = [0, 0, count($distance)];
        for ($i = $start; $i !== $destination; $i = ($i + 1) % $n) {
            $a += $distance[$i];
        }
        for ($i = $destination; $i !== $start; $i = ($i + 1) % $n) {
            $b += $distance[$i];
        }

        return min($a, $b);
    }
}


1			<?php
2
3			declare(strict_types=1);
4
5			namespace leetcode;
6
7			class DistanceBetweenBusStops
8			{
9			public static function distanceBetweenBusStops(array $distance, int $start, int $destination): int
10			{
11			if (empty($distance) \|\| $start < 0 \|\| $destination < 0) {
12			return 0;
13			}
14			if ($start > $destination) {
15			$tmp = $start;
16			$start = $destination;
17			$destination = $tmp;
18			}
19			$res = $sum = 0;
20			foreach ($distance as $i => $value) {
21			if ($i >= $start && $i < $destination) {
22			$res += $value;
23			}
24			$sum += $value;
25			}
26
27			return min($res, $sum - $res);
28			}
29
30			public static function distanceBetweenBusStops2(array $distance, int $start, int $destination): int
31			{
32			if (empty($distance) \|\| $start < 0 \|\| $destination < 0) {
33			return 0;
34			}
35			[$a, $b] = [min($start, $destination), max($start, $destination)];
36			$slice = array_slice($distance, $a, $b - $a);
37
38			return min(array_sum($slice), array_sum($distance) - array_sum($slice));
39			}
40
41			public static function distanceBetweenBusStops3(array $distance, int $start, int $destination): int
42			{
43			if (empty($distance) \|\| $start < 0 \|\| $destination < 0) {
44			return 0;
45			}
46			[$a, $b, $n] = [0, 0, count($distance)];
47			for ($i = $start; $i !== $destination; $i = ($i + 1) % $n) {
48			$a += $distance[$i];
49			}
50			for ($i = $destination; $i !== $start; $i = ($i + 1) % $n) {
51			$b += $distance[$i];
52			}
53
54			return min($a, $b);
55			}
56			}
57

imajinyun / leetcode-php

Push — master ( c19dce...c10a28 )

distanceBetweenBusStops2() A

Complexity

Size

Duplication

Importance

Duplication Side-by-Side

Filter issues like