LeetCode-704 Binary Search

Description

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.

Constraints:
• 1 <= nums.length <= 10${}^4$
• -9999 <= nums[i], target <= 9999
• All the integers in nums are unique.
• nums is sorted in an ascending order.

Example

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

Submissions

解题思路二分查找，需要注意 while 循环时的 left 要小于等于 right，其次便是更新 left 和 right 参数，如果取到的值小于 target，则将 left 向右更新为当前值的下一位，如果取到的值大于 target ，则将 right 向左更新为当前值的上一位，如果取到的值恰好等于 target，则返回当前位置即可。如果循环完成未找到 target，则返回 -1。

实现代码如下：

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