题解 | #二分查找-I#

import java.util.*;


public class Solution {
    /**
     * 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可
     *
     *
     * @param nums int整型一维数组
     * @param target int整型
     * @return int整型
     */
    public static int search(int[] nums, int target) {
        int min = 0;
        int max = nums.length - 1;
        while (max >= min) {
            int middle  = (max + min) / 2;
            if (nums[middle] > target) {
                max = middle - 1;
            } else if (nums[middle] < target) {
                min = middle + 1;
            } else if (nums[middle] == target) {
               return middle;
            }
        }
        return -1;
    }
}