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 searchInsert(vector<int>& nums, int target) {        int mid = 0,left = 0,right = nums.size();        while(left<right)        {            mid = (left+right)/2;            if(nums[mid]<target)            {                left = mid +1;            }else if(nums[mid]>target)            {                right = mid;            }else{                return mid;            }        }        mid = (left+right)/2;        return mid;    }

性能：