leetcode\DistributeCandies

Complexity

Total Complexity

8

Size/Duplication

Total Lines	29
Duplicated Lines	0 %

Importance

Changes	2
Bugs	0	Features	0

2 Methods

Rating	Name	Duplication	Size	Complexity
A	distributeCandies2()	0	11	3
A	distributeCandies()	0	14	5

<?php

namespace leetcode;

class DistributeCandies
{
    public static function distributeCandies(array $candies): int
    {
        if (empty($candies)) {
            return 0;
        }
        sort($candies);
        [$cnt, $len] = [1, count($candies)];
        for ($i = 1; $i < $len && $cnt < $len / 2; $i++) {
            if ($candies[$i] > $candies[$i - 1]) {
                $cnt++;
            }
        }

        return $cnt;
    }

    public static function distributeCandies2(array $candies): int
    {
        if (empty($candies)) {
            return 0;
        }
        [$map, $len] = [[], count($candies)];
        foreach ($candies as $candy) {
            $map[$candy] = true;
        }

        return min(count($map), $len / 2);
    }
}