Oh right this thing
This commit is contained in:
@@ -625,3 +625,16 @@ def traverse_neighborly_node(
|
||||
continue
|
||||
|
||||
yield from traverse_neighborly_node(neighbor, memo)
|
||||
|
||||
|
||||
def find_min_in_rotated_array(nums: list[int]) -> int:
|
||||
if nums[0] <= nums[-1]:
|
||||
return nums[0]
|
||||
|
||||
if len(nums) <= 3:
|
||||
return min(nums)
|
||||
|
||||
if nums[len(nums) // 2] > nums[-1]:
|
||||
return find_min_in_rotated_array(nums[len(nums) // 2 :])
|
||||
|
||||
return find_min_in_rotated_array(nums[: (len(nums) // 2) + 1])
|
||||
|
||||
Reference in New Issue
Block a user