forked from shuboc/LeetCode-2
-
Notifications
You must be signed in to change notification settings - Fork 0
/
find-minimum-in-rotated-sorted-array.py
57 lines (47 loc) · 1.3 KB
/
find-minimum-in-rotated-sorted-array.py
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
from __future__ import print_function
# Time: O(logn)
# Space: O(1)
#
# Suppose a sorted array is rotated at some pivot unknown to you beforehand.
#
# (i.e., 0 1 2 4 5 6 7 might become 4 5 6 7 0 1 2).
#
# Find the minimum element.
#
# You may assume no duplicate exists in the array.
#
class Solution(object):
def findMin(self, nums):
"""
:type nums: List[int]
:rtype: int
"""
left, right = 0, len(nums)
target = nums[-1]
while left < right:
mid = left + (right - left) / 2
if nums[mid] <= target:
right = mid
else:
left = mid + 1
return nums[left]
class Solution2(object):
def findMin(self, nums):
"""
:type nums: List[int]
:rtype: int
"""
left, right = 0, len(nums) - 1
while left < right and nums[left] >= nums[right]:
mid = left + (right - left) / 2
if nums[mid] < nums[left]:
right = mid
else:
left = mid + 1
return nums[left]
if __name__ == "__main__":
print(Solution().findMin([1]))
print(Solution().findMin([1, 2]))
print(Solution().findMin([2, 1]))
print(Solution().findMin([3, 1, 2]))
print(Solution().findMin([2, 3, 1]))