# 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.
Example 1:
Input: [1,3,5,6], 5
Output: 2
Example 2:
Input: [1,3,5,6], 2
Output: 1
Example 3:
Input: [1,3,5,6], 7
Output: 4
Example 4:
Input: [1,3,5,6], 0
Output: 0
# Solution
Approach 1: Binary search.
# Code (Python)
Approach 1:
# Code (C++)
Approach 1:
class Solution {
public:
int searchInsert(vector<int>& nums, int target) {
int head = 0;
int tail = nums.size() - 1;
while (head <= tail)
{
int mid = head + (tail - head) / 2;
if (nums[mid] == target)
return mid;
else if (nums[mid] < target)
head = mid + 1;
else
tail = mid - 1;
}
return head;
}
};