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
Atcually even if you didn't find target in the list, the latest srt is the position( if srt > end) or lastest end + 1 is the position (if end < srt).
So in colusion, the latest srt is the position.
1 public class Solution { 2 public int searchInsert(int[] A, int target) { 3 if(A == null || A.length == 0) return 0; 4 int srt = 0, end = A.length - 1, mid = 0; 5 while(srt <= end){ 6 mid = (srt + end) / 2; 7 if(A[mid] == target) return mid; 8 else if(A[mid] < target) srt = mid + 1; 9 else end = mid - 1; 10 } 11 return srt; 12 } 13 }