leetcode No35. Search Insert Position

Question：

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

Algorithm：

二分查找

Accepted Code：

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