In this Leetcode Search Insert Position problem solution, we have 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.

Leetcode 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;
}