【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

二分查找法

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