Find Minimum in Rotated Sorted Array II LeetCode solution in Python

1
class Solution:
2
def findMin(self, nums: List[int]) -> int:
3
return min(nums)

0

WPM •0 •0

100%

ACC •0 •0

0s

TIME •0