题解 | #二分查找-I#

import java.util.*;


public class Solution {
    /**
     * 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可
     *
     *
     * @param nums int整型一维数组
     * @param target int整型
     * @return int整型
     */
    public int search (int[] nums, int target) {
        // write code here
        int right = nums.length - 1, left = 0, mis = 0;

        while (left <= right) {
            mis = (right - left) / 2 + left;
            if (nums[mis] > target) {
                right = mis - 1;
            } else if (nums[mis] == target) {
                return mis;
            } else {
                left = mis + 1;
            }
        }

        return -1;
    }
}