leetcode\SearchInsertPosition

Complexity

Total Complexity

5

Size/Duplication

Total Lines	21
Duplicated Lines	0 %

Importance

Changes	3
Bugs	0	Features	0

1 Method

Rating	Name	Duplication	Size	Complexity
A	searchInsert()	0	19	5

<?php

declare(strict_types=1);

namespace leetcode;

class SearchInsertPosition
{
    public static function searchInsert(array $nums, int $target): int
    {
        if (empty($nums)) {
            return 0;
        }
        [$low, $high] = [0, count($nums) - 1];
        while ($low <= $high) {
            $mid = (int) (($high + $low) / 2);

The assignment to $mid is dead and can be removed.

            $mid = $low + intdiv($high - $low, 2);
            if ($nums[$mid] > $target) {
                $high = $mid - 1;
            } elseif ($nums[$mid] < $target) {
                $low = $mid + 1;
            } else {
                return $mid;
            }
        }

        return $low;
    }
}