用Python来实现二分查找
1、问题需求
输入列表[1,4,4,5,7,7,8,9,9,10]和目标整数1,输出其所在的位置为0,即第1次出现在第0个位置。输入列表[1,2,3,3,4,5,10]和整数目标3,输出2,即第一次出现2的位置。输入列表[1,2,3,4,5,10]和目标整数6,输出-1,即没有出现过6,返回-1
2、代码实现
class Solution:
def binarySearch(self, nums, target):
return self.search(nums, 0, len(nums) - 1, target)
def search(self, nums, start, end, target):
if start > end:
return -1
mid = (start + end) // 2
if nums[mid] > target:
return self.search(nums, start, mid, target)
if nums[mid] == target:
return mid
if nums[mid] < target:
return self.search(nums, mid, end, target)
if __name__ == '__main__':
my_solution = Solution()
nums = [3, 8, 2, 4, 1, 5, 7, 0]
target = 4
targetIndex = my_solution.binarySearch(nums, target)
print(f'输入:列表{nums},查询{target}索引所在的位置')
print(f'输出:{targetIndex}')
好了,需求实现了,啦啦啦!
标签:二分,__,return,target,nums,Python,self,mid,查找
来源: https://blog.csdn.net/qq_44240254/article/details/113664648