| 4 | #Memory: 5.97% |
| 5 | |
| 6 | class Solution: |
| 7 | def searchInsert(self, nums: List[int], target: int) -> int: |
| 8 | l = 0 |
| 9 | r = len(nums)-1 |
| 10 | while l <= r: |
| 11 | m = (l+r)//2 |
| 12 | if m == r and target > nums[m]: |
| 13 | return m + 1 |
| 14 | if target > nums[m]: |
| 15 | l = m + 1 |
| 16 | else: |
| 17 | r = m - 1 |
| 18 | return m |
nothing calls this directly
no outgoing calls
no test coverage detected