35. Search Insert Position

Binary Search 살짝만 바꿔주자

class Solution:
    def searchInsert(self, nums: List[int], target: int) -> int:
        return self.binary_search(nums, 0, len(nums)-1, target)
        
    def binary_search(self, nums, l, r, target):
        if l == r:
            if target <= nums[l]:
                return l
            else:
                return l + 1
        mid_idx = (l + r) // 2
        mid = nums[mid_idx]
        if target <= mid:
            return self.binary_search(nums, l, mid_idx, target)
        else:
            return self.binary_search(nums, mid_idx+1, r, target)