leetcode\FindTheDuplicateNumber

Complexity

Total Complexity

15

Size/Duplication

Total Lines	62
Duplicated Lines	0 %

Importance

Changes	1
Bugs	0	Features	0

4 Methods

Rating	Name	Duplication	Size	Complexity
A	findDuplicate()	0	8	2
A	findDuplicate2()	0	11	3
A	findDuplicate3()	0	17	6
A	findDuplicate4()	0	18	4

<?php

declare(strict_types=1);

namespace leetcode;

class FindTheDuplicateNumber
{
    public static function findDuplicate(array $nums): int
    {
        if (empty($nums)) {
            return 0;
        }
        $map = array_count_values($nums);

        return array_search(max($map), $map, true);

The expression return array_search(max($map), $map, true) could return the type string which is incompatible with the type-hinted return integer. Consider adding an additional type-check to rule them out.

    }

    public static function findDuplicate2(array $nums): int
    {
        if (empty($nums)) {
            return 0;
        }
        $map = [];
        foreach ($nums as $num) {
            $map[$num] = ($map[$num] ?? 0) + 1;
        }

        return array_search(max($map), $map, true);

The expression return array_search(max($map), $map, true) could return the type string which is incompatible with the type-hinted return integer. Consider adding an additional type-check to rule them out.

    }

    public static function findDuplicate3(array $nums): int
    {
        if (empty($nums)) {
            return 0;
        }
        [$low, $high] = [$nums[0], count($nums) - 1];
        while ($low < $high) {
            [$cnt, $mid] = [0, $low + (int)(($high - $low) / 2)];
            foreach ($nums as $num) {
                if ($num <= $mid) {
                    $cnt++;
                }
            }
            $cnt <= $mid ? ($low = $mid  + 1) : ($high = $mid);
        }

        return $low;
    }

    public static function findDuplicate4(array $nums): int
    {
        if (empty($nums)) {
            return 0;
        }
        [$slow, $fast] = [$nums[0], $nums[$nums[0]]];
        while ($slow !== $fast) {
            $slow = $nums[$slow];
            $fast = $nums[$nums[$fast]];
        }

        $fast = 0;
        while ($slow !== $fast) {
            $fast = $nums[$fast];
            $slow = $nums[$slow];
        }

        return $slow;
    }
}