comefrom: <qiyuangong>154_Find_Minimum_in_Rotated_Sorted_Array_II_1.py
code: def findMin( nums):
      start, end = 0, len(nums) - 1
      while start < end:
          mid = (start + end) / 2
          if nums[mid] > nums[end]:
              start = mid + 1
          elif nums[mid] < nums[end]:
              end = mid
          else:
              end -= 1
      return nums[start]
masked: def sample_funcname ( var_0 ) :
      var_1 , var_2 = 0 , len ( var_0 ) - 1
      while var_1 < var_2 :
          var_3 = ( var_1 + var_2 ) / 2
          if var_0 [ var_3 ] > var_0 [ var_2 ] :
              var_1 = var_3 + 1
          elif var_0 [ var_3 ] < var_0 [ var_2 ] :
              var_2 = var_3
          else :
              var_2 -= 1
      return var_0 [ var_1 ]
  