in Array Binary Search ~ read.

Search Insert Position

35. 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
public class Solution {  
    public int searchInsert(int[] nums, int target) {
        if (nums == null || nums.length == 0) {
            return 0;
        }

        int low = 0, high = nums.length - 1;

        while (low + 1 < high) {
            int middle = low + (high-low)/2;

            if (nums[middle] == target) {
                return middle;
            } else if (nums[middle] > target) {
                high = middle;
            } else {
                low = middle;
            }
        }

        if (nums[low] >= target) {
            return low;
        } else if (nums[high] >= target) {
            return high;
        } else {
            return high + 1;
        }
    }
}

Hope this helps,
Michael