二分查找 - 704 - leetcode

代码随想录算法训练营 | 第一天 | 打卡博客

func search(nums []int, target int) int {
    low, high := 0, len(nums)-1
    for low <= high {
        mid := low + (high - low) / 2
        if target == nums[mid] {
            return mid
        } else if target > nums[mid] {
            low = mid + 1
        } else {
            high = mid - 1
        }
    }
    return -1
}