题目
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