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
1 public class Solution { 2 public int searchInsert(int[] A, int target) { 3 int len = A.length; 4 if (len==0) return -1; 5 6 int head = 0, end = A.length-1; 7 8 //NOTE:Consider these coner cases carefully! 9 if (target<=A[head]) return head; 10 if (target>A[end]) return end+1; 11 else if (target==A[end]) return end; 12 13 while (end-head>1){ 14 int mid = (head+end)/2; 15 if (A[mid]==target) return mid; 16 else if (A[mid]>target) 17 end = mid; 18 else 19 head = mid; 20 } 21 return end; 22 23 } 24 }
Leetcode-Search Insert Position
原文：http://www.cnblogs.com/lishiblog/p/4107799.html