35. Search Insert Position

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

Subscribe to see which companies asked this question

代码：

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

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