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

典型的二分查找，模板解决：模板：Binary Search - 二分搜索，代码如下：

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