LeetCode 704. JavaScript-решение для бинарного поиска

var search = function(nums, target) {
    let left = 0
    let right = nums.length - 1
    while ( right >= left) {
       let mid = Math.floor((left + right)/2)
       if (target > nums[mid]) {
            left = mid + 1
       } else if (target < nums[mid]) {
            right = mid - 1
       } else {
            return mid
       }
    }
    return -1
};