【Python Leetcode】704. Binary Search

最新推荐文章于 2024-09-06 09:22:51 发布

jessie_31655616

最新推荐文章于 2024-09-06 09:22:51 发布

阅读量102

点赞数

分类专栏： python leetcode 文章标签： leetcode 算法 python

本文链接：https://blog.csdn.net/jessie_31655616/article/details/126032067

版权

python leetcode 专栏收录该内容

10 篇文章 0 订阅

订阅专栏

题目

Given an array of integers nums which is sorted in ascending order, and an integer target, write a function to search target in nums. If target exists, then return its index. Otherwise, return -1.

You must write an algorithm with O(log n) runtime complexity.

Example 1:

Input: nums = [-1,0,3,5,9,12], target = 9
Output: 4
Explanation: 9 exists in nums and its index is 4

Example 2:

Input: nums = [-1,0,3,5,9,12], target = 2
Output: -1
Explanation: 2 does not exist in nums so return -1

Constraints:

1 <= nums.length <= 104
-104 < nums[i], target < 104
All the integers in nums are unique.
nums is sorted in ascending order.

思路：二分法

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

            elif nums[mid]<target:
                left = mid
            elif nums[mid]>target:
                right = mid

            mid = (left+right) / 2
            if mid == left:
                if nums[mid]==target:
                    return mid
                else:
                    return -1
            
            # print('left:'+str(left)+', mid'+str(mid)+', right'+str(right))
            
        return -1