leetcode\DistanceBetweenBusStops

Complexity

Total Complexity

18

Size/Duplication

Total Lines	48
Duplicated Lines	0 %

Importance

Changes	1
Bugs	0	Features	0

3 Methods

Rating	Name	Duplication	Size	Complexity
B	distanceBetweenBusStops()	0	19	8
A	distanceBetweenBusStops2()	0	9	4
A	distanceBetweenBusStops3()	0	14	6

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