LeetCode 筆記 - 35. Search Insert Position

Posted on

題目在此 35. Search Insert Position

給一個 Sorting 過的數列與 target
找出 target 的 index，如果不存在就找出 target 可以插入的 index

解題思維

就實作 Binary Search 就可以解決了

完成✅

程式碼

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
class Solution:
    def searchInsert(self, nums: List[int], target: int) -> int:
        if not nums:
            return -1
        
        length = len(nums)
        
        start = 0
        end = length - 1
        
        while start <= end:
            mid = int((start + end) / 2)
            
            if nums[mid] == target:
                return mid
            elif nums[mid] < target:
                start = mid + 1
            else:
                end = mid - 1
            
        return start
1
2
3
class Solution:
    def searchInsert(self, nums: List[int], target: int) -> int:
        return bisect.bisect_left(nums, target)

也許你也會想看看