Search Insert Position Problem: Given a sorted array of distinct integers 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 must write an algorithm with O(log n)
runtime complexity.
Example :
Input: nums = [1,3,5,6], target = 5
Output: 2
Table of Contents
Search Insert Position Problem Solution
Problem Solution In Python
class Solution:
def searchInsert(self, nums: List[int], target: int) -> int:
try:
for i, num in enumerate(nums):
if target == num or target < num:
return i
return i + 1
except:
return 0
Problem Solution In Java
class Solution {
public int searchInsert(int[] nums, int target) {
for(int i =0;i<nums.length;i++){
if(target<=nums[i]){
return i;
}
}
return nums.length;
}
}
Problem Solution In C++
class Solution {
public:
int searchInsert(vector<int>& nums, int target) {
for (auto i = 0; i < nums.size(); ++i)
if (target <= nums[i]) return i;
return nums.size();
}
};
Problem Solution In C
int searchInsert(int* nums, int numsSize, int target) {
register int i;
for (i = 0; i < numsSize && target > nums[i]; i++);
return i;
}