注:本篇所运用的知识可见主页中数据结构概念及数组基本知识
(1)LeetCode704
“二分查找”
题目要求在一个排序的整数数组 nums
中找到给定目标值 target
的索引,如果数组中不存在 target
则返回 -1
。
示例如下:
def search(nums, target):
left, right = 0, 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
# 示例
nums = [1, 2, 3, 4, 5, 6, 7, 8, 9]
target = 5
print(search(nums, target))
target = 10
print(search(nums, target))
(2)LeetCode35
“搜索插入位置”
题目要求在一个排序的整数数组 nums
中找到给定目标值 target
的插入位置。如果数组中存在 target
,则返回它的索引;如果不存在,则返回它将会被按顺序插入的位置。
示例如下:
def searchInsert(nums, target):
left, right = 0, 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
# 示例
nums = [1, 3, 5, 6]
target = 5
print(searchInsert(nums, target))
target = 2
print(searchInsert(nums, target))
target = 7
print(searchInsert(nums, target))
target = 0
print(searchInsert(nums, target))