LeetCode 训练场：704. 二分查找

public int search(int[] nums, int target) {
    int left = 0;
    int right = nums.length - 1;
    while (left <= right) {
        int middle = left + (right - left) / 2;
        // 目标值等于中间元素，则找到目标值
        if (target == nums[middle]) {
            return middle;
        } else if (target > nums[middle]) {
            // 目标值较大，则继续在右侧搜索
            left = middle + 1;
        } else {
            // 目标值较小，继续在左侧搜索
            right = middle - 1;
        }
    }

    return -1;
}