Medium, Binary Search
假设升序序列在某个点被旋转了，寻找最小数。
For Example
(0 1 2 4 5 6 7旋转以后成为 4 5 6 7 0 1 2).
假设序列中无重复数字
使用二分搜索。
class Solution(object):
def findMin(self, nums):
"""
:type nums: List[int]
:rtype: int
"""
L, R = 0, len(nums)-1
while L<R and nums[L] > nums[R]:
M = (L+R)/2
if nums[M] > nums[R]:
L = M+1
else:
R = M
return nums[L]
- Find Minimum in Rotated Sorted Array it counts when it'...
Find Minimum in Rotated Sorted ArraySuppose an array sort...
ollow up for "Find Minimum in Rotated Sorted Array":What ...
Find Minimum in Rotated Sorted Array Suppose an array sor...
Follow up for "Find Minimum in Rotated Sorted Array":What...
Follow up for "Find Minimum in Rotated Sorted Array":What...
Find Minimum in Rotated Sorted Array Suppose an array sor...
Follow up for "Find Minimum in Rotated Sorted Array":What...
153 Find Minimum in Rotated Sorted Array "Suppose an arr...
LeetCode 153 Find Minimum in Rotated Sorted Array I Suppo...
本文标题：Find Minimum in Rotated Sorted A
本文链接：https://www.haomeiwen.com/subject/qdejjxtx.html
网友评论