题解 | #二分查找-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 min = 0;
        int max = nums.length - 1;
        int mid = (min + max) / 2;
        if(nums == null || nums.length == 0){
            return -1;
        }
        while (nums[mid] != target) {
            if (nums[mid] > target) {
                max = mid - 1;
            }
            if (nums[mid] < target) {
                min = mid + 1;
            }
            if (min > max) {//循环终止条件
                return -1;
            }
            mid = (min + max)/2;
        }
        return mid;
    }
}