Link: 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
Since the code satisfy that l always points to the first index larger than target, r always points to the first index smaller than target.
Time: O(logn), Space: O(1)
public class Solution {
public int searchInsert(int[] A, int target) {
int l = 0;
int r = A.length - 1;
int m = (l+r)/2;
while(l <= r){
m = (l+r)/2;
if(A[m] == target) return m;
else if(A[m] < target){
l = m + 1;
}
else{
r = m - 1;
}
}
return l;//can also use return r+1
}
}