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
public class Solution { public int searchInsert(int[] A, int target) { // Start typing your Java solution below // DO NOT write main() function if(A == null || A.length == 0) return 0; int end = A.length-1; int i = 0; while( i<= end){ int mid = (i+end) /2; if(A[mid] == target) return mid; else if (A[mid] < target){ i = mid + 1; } else{ end = mid -1; } } return i ; } }