力扣-Java搜索插入位置

思路：

利用二分查找法

题解： 

class Solution {
    public int searchInsert(int[] nums, int target) {
        //左指针和右指针
        int left = 0;
        int right = nums.length - 1;
        
        while (left <= right){//左闭右闭
            int mid = left + (right - left)/2;//防止溢出
            if (nums[mid] == target){
                return mid;
            }else if (nums[mid] > target){
                //下一轮搜索区间是[left..mid]
                right = mid - 1; //右指针右移
            }else if (nums[mid] < target){
                //下一轮搜索区间是[mid + 1..right]
                left = mid + 1; //左指针左移
            }
        }return left;
    }
}