Leetcode -- Search Insert Position

问题链接：https://oj.leetcode.com/problems/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

问题API： public int searchInsert(int[] A, int target)

问题分析：这题利用到的就是上一题里用到的binary search的性质，一旦搜索不到，head就是该元素应该插入的位置。代码如下： public int searchInsert(int[] A, int target) {
int mid, head = 0, tail = A.length - 1;
while(head <= tail){
mid = (head + tail) / 2;
if(A[mid] == target)
return mid;
else if(A[mid] < target)
head = mid + 1;
else
tail = mid - 1;
}
return head;
}