35. 搜索插入位置

一、35. 搜索插入位置

1.1、题目描述

1.2、题解

1.2.1、二分查找

class Solution:
    def searchInsert(self, nums: List[int], target: int) -> int:
        left = 0
        right = len(nums) - 1
        while left <= right:
            mid = (left + right) // 2
            if nums[mid] == target:
                return mid
            elif nums[mid] < target :
                left  = mid + 1
            else:
                right = mid - 1
        return left

二、704. 二分查找

2.1、题目描述

2.2、题解

2.2.1、二分查找

与35. 搜索插入位置的区别： 插入位置与目标值的寻找

class Solution:
    def search(self, nums: List[int], target: int) -> int:  
        left = 0
        right = len(nums) - 1
        while left <= right:
            mid = (left + right) // 2
            if nums[mid] == target:
                return mid
            elif nums[mid] < target :
                left  = mid + 1
            else:
                right = mid - 1
        return -1