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

在有序数组中查找给定值的插入位置。
这道题相对简单。

int SearchInsertPosition::searchInsert(vector<int>& nums, int target){    if (nums.empty()) return 0;    int i = 0, j = nums.size() - 1;    while (i < j)    {        int mid = (i + j) / 2;        int midNum = nums[mid];        if (target > midNum) i = mid + 1;        else j = mid;    }    if (target <= nums[i]) return i;    else return i + 1;}