Search Insert Position

LeetCode Q 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.

Solution

Code:

public int searchInsert(int[] nums, int target) {
	if (nums == null || nums.length == 0 || target <= nums[0])
		return 0;
	int left = 0, right = nums.length - 1;
	while (left <= right) {
		int mid = (left + right) / 2;
		if (nums[mid] == target) return mid;
		else if (nums[mid] < target) left = mid + 1;
		else right = mid - 1;
	}
	return left;
}