LeetCode---35. Search Insert Position（查找插入位置）

Given a sorted array and a target value, return the index if the target is found. If not, return the index where it would be if it were inserted in order.

You may assume no duplicates in the array.

Here are few examples.

[1,3,5,6]

, 5 → 2

[1,3,5,6]

, 2 → 1

[1,3,5,6]

, 7 → 4

[1,3,5,6]

, 0 → 0

普通查找时间复杂度：O（n）；二分法可以节省时间；

public class Solution {
public int searchInsert(int[] nums, int target) {
int start=0,end=nums.length-1,mid;
if(target<=nums[0]){return 0;}
if(target>nums[nums.length-1]){return nums.length;}
while(start<end-1){
mid=(start+end)/2;
if(nums[mid]==target){return mid;}
else if(nums[start]<target&&target<nums[mid]){end=mid;}
else{start=mid;}

}
return start+1;
}
}