leetcode\SumOfDigitsInTheMinimumNumber::sumOfDigits()

Complexity

Conditions	6
Paths	13

Size

Total Lines	18
Code Lines	11

Duplication

Lines	0
Ratio	0 %

Importance

Changes	2
Bugs	0	Features	0

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