题解 | #二分查找-I#

总结：
1.二分查找通过改变low,high,计算mid。防止出现大数问题，mid计算推荐mid=low+(high-low)/2

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,high = nums.length-1,mid;
        while(low<=high){
            mid = low+(high-low)/2;
            if(nums[mid]>target)
                high = mid-1;
            else if(nums[mid]<target)
                low = mid+1;
            else
                return mid;

        }
        return -1;
    }
}