[leetcode] 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

这道题是确定给定值在已排序数组中的插入位置，题目难度为Medium。

二分查找法的题目，没太多好讲的，对二分查找还不太清楚的同学可以着重看一下代码。具体代码：

class Solution {
public:
int searchInsert(vector<int>& nums, int target) {
int bgn = 0, end = nums.size()-1, mid;
while(bgn <= end) {
mid = (bgn + end) / 2;
if(nums[mid] > target) end = mid - 1;
else if(nums[mid] < target) bgn = mid + 1;
else return mid;
}
return bgn;
}
};