class Solution: def searchInsert(self, nums, target): """ :type nums: List[int] :type target: int :rtype: int """ nums.sort() for idx,num in enumerate(nums): if target>nums[-1]: return len(nums) elif target<nums[0]: return 0
elif target==num:
return (idx)
elif idx <=len(nums)-2 and target>nums[idx] and target<nums[idx+1]:
return (idx+1)
