【数组相关】35. 搜索插入位置

原题链接：https://leetcode-cn.com/problems/search-insert-position/

---

---

典型的二分查找算法，不太懂的自行百度吧

class Solution {
    public int searchInsert(int[] nums, int target) {
        if(nums==null||nums.length==0){
        	return 0;
        }
        int low=0;
        int high=nums.length-1;
        int mid=(low+high)/2;
        if(nums[low]==target){
        	return low;
        }
        if(nums[high]==target){
        	return high;
        }
        while(low<=high){
        	if(nums[mid]==target){
        		return mid;
        	}
        	if(nums[mid]<target){
        		low=mid+1;
        	}else{
        		high=mid-1;
        	}
        	mid=(low+high)/2;
        }
        return low;
    }
}