|
1 | 1 | class Solution: |
2 | 2 | def searchInsert(self, nums: List[int], target: int) -> int: |
3 | | - if target in nums: |
4 | | - return nums.index(target) |
5 | | - elif target > nums[len(nums)-1]: |
6 | | - return len(nums) |
7 | | - else: |
8 | | - for i in range(len(nums)): |
9 | | - if nums[i]>target: |
10 | | - return nums.index(nums[i]) |
| 3 | + # This one is better -> time complexity |
| 4 | + |
| 5 | + # if target in nums: |
| 6 | + # return nums.index(target) |
| 7 | + # elif target > nums[len(nums)-1]: |
| 8 | + # return len(nums) |
| 9 | + # else: |
| 10 | + # for i in range(len(nums)): |
| 11 | + # if nums[i]>target: |
| 12 | + # return nums.index(nums[i]) |
| 13 | + |
| 14 | + for index,item in enumerate(nums): |
| 15 | + if item >= target: |
| 16 | + return index |
| 17 | + continue |
| 18 | + return len(nums) |
0 commit comments