剑指 Offer II 068. 查找插入位置

复健~
典型二分查找，详细注释见代码

class Solution {
    public int searchInsert(int[] nums, int target) {
        int i = 0;
        int j = nums.length-1;
        while(i<=j){
            int mid = i+(j-i)/2;
            //每次都造一个新的mid出来
            if(nums[mid] == target) return mid;
            if( nums[mid] < target ) i = mid+1;
            //如果在右边 就让左边界移动
            if( nums[mid] > target ) j = mid-1;
        }
        return i;
    }
}