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

Analyse: Binary search. Whenever meeting a number, compare the pre/next number with the target.

Runtime: 8ms.

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