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

问题分析：

一个简单的二分查找案例，过程详见代码

class Solution {public:    int searchInsert(vector<int>& nums, int target) {        int left = 0;    int right = nums.size() - 1;        int mid = right / 2;        while(left < right)        {        // 如果找到了,则直接返回         if(target == nums[mid]) return mid;        else if(target < nums[mid])        {        right = mid - 1;        mid = (left + right) / 2;}else{left = mid + 1;mid = (left + right) / 2;}}        if(target > nums[mid]) return mid + 1;return mid;    }};

是不是heneasy~~·