php 二分查找

$nums = [-1,0,3,5,9,12];
$target = 9;
function search($nums, $target) {
    $left = 0;
    $right = count($nums) - 1;
    while ($left<=$right){
        $middle_key = (int)($left + ($right - $left) / 2);
        if($nums[$middle_key] < $target){
            $left = $middle_key+1;
        }else if($nums[$middle_key] > $target){
            $right = $middle_key-1;
        }else{
            return $middle_key;
        }
    }
    return(-1);
}

https://leetcode-cn.com/problems/binary-search/submissions/