leetcode\SumOfDigitsInTheMinimumNumber

Complexity

Total Complexity

6

Size/Duplication

Total Lines	20
Duplicated Lines	0 %

Importance

Changes	1
Bugs	0	Features	0

1 Method

Rating	Name	Duplication	Size	Complexity
A	sumOfDigits()	0	18	6

<?php

declare(strict_types=1);

namespace leetcode;

class SumOfDigitsInTheMinimumNumber
{
    public static function sumOfDigits(array $nums): int
    {
        if (empty($nums)) {
            return 0;
        }
        $min = PHP_INT_MAX;
        foreach ($nums as $num) {
            if ($num < $min) {
                $min = $num;
            }
        }
        $sum = 0;
        while ($min > 0) {
            $sum += $min % 10;
            $min /= 10;
        }

        return $sum % 2 === 0 ? 1 : 0;
    }
}