LeetCode | 704.二分查找
- 标准的二分查找，直接上模板！
class Solution(object):def search(self, nums, target):""":type nums: List[int]:type target: int:rtype: int"""l = 0r = len(nums) - 1while l <= r:mid = (l + r + 1) / 2if nums[mid] == target:return midelif nums[mid] < target:l = mid + 1else:r = mid - 1return -1
