leetcode\MinimumCostToMoveChipsToTheSamePosition

Complexity

Total Complexity

4

Size/Duplication

Total Lines	13
Duplicated Lines	0 %

Importance

Changes	1
Bugs	0	Features	0

1 Method

Rating	Name	Duplication	Size	Complexity
A	minCostToMoveChips()	0	11	4

<?php

declare(strict_types=1);

namespace leetcode;

class MinimumCostToMoveChipsToTheSamePosition
{
    public static function minCostToMoveChips(array $position): int
    {
        if (empty($position)) {
            return 0;
        }
        $odd = $even = 0;
        foreach ($position as $value) {
            $value % 2 === 0 ? $even++ : $odd++;
        }

        return min($odd, $even);
    }
}