Time complexity:
Space complexity:
class Solution:
def findMin(self, nums: List[int]) -> int:
low, high = 0, len(nums) - 1
while low < high:
mid = (low + high) // 2
if nums[mid] > nums[high]:
low = mid + 1
else:
high = mid
return nums[low]
A seemingly more complicated approach that I actually seem to understand better
Time complexity:
Space complexity:
class Solution:
def findMin(self, nums: List[int]) -> int:
if len(nums) == 1:
return nums[0]
low, high = 0, len(nums) - 1
while low <= high:
mid = (low + high) // 2
if (mid > 0 and nums[mid] < nums[mid - 1]) or (mid == 0 and nums[mid] < nums[high]):
return nums[mid]
elif nums[mid] > nums[high]:
low = mid + 1
else:
high = mid