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
这道题主要考察二分查找。代码如下：
class Solution { public: int searchInsert(vector<int>& nums, int target) { int i = 0; int j = nums.size() - 1; while (i <= j){ int mid = (i + j) >> 1; if (nums[mid] == target) return mid; else if (nums[mid] < target) i = mid + 1; else j = mid - 1; } return i; //当找不到时，i值会相应的指示。 } };
