题解 | #二分查找-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 low = 0;
        int high = nums.length - 1;
        //1,3,5,7,9. ->6
        //0 4 ->5<6
        //5 9 7>6
        //
        
        while(low <= high){
            if(target == nums[low + (high - low)/2]){
                return low + (high - low)/2;
            }else if(target > nums[low + (high - low)/2]){
                low = low + (high - low)/2 + 1;
            }else{
                high = low+(high - low)/2 -1;
            }
        }
        return -1;      
    }
}