text: class Solution:
      def findMin(self, nums: List[int]) -> int:
          low = 0
          high = len(nums) - 1
          while high > low:
              pivot = (low + high) // 2
              if nums[pivot] < nums[high]:
                  high = pivot
              elif nums[pivot] > nums[high]:
                  low = pivot + 1
              else:
                  high -= 1
          return nums[low]