comefrom: <doocs>0154.Find Minimum in Rotated Sorted Array II_1.py
code: def findMin( nums: List[int]) -> int:
      left, right = 0, len(nums) - 1
      while left < right:
          mid = (left + right) >> 1
          if nums[mid] > nums[right]:
              left = mid + 1
          elif nums[mid] < nums[right]:
              right = mid
          else:
              right -= 1
      return nums[left]
masked: def sample_funcname ( var_0 : List [ int ] ) -> int :
      var_4 , var_7 = 0 , len ( var_0 ) - 1
      while var_4 < var_7 :
          var_8 = ( var_4 + var_7 ) >> 1
          if var_0 [ var_8 ] > var_0 [ var_7 ] :
              var_4 = var_8 + 1
          elif var_0 [ var_8 ] < var_0 [ var_7 ] :
              var_7 = var_8
          else :
              var_7 -= 1
      return var_0 [ var_4 ]
  