comefrom: <qiyuangong>154_Find_Minimum_in_Rotated_Sorted_Array_II_2.py
code: def findMin( nums):
      l, r = 0, len(nums) - 1
      while l < r and nums[l] >= nums[r]:
          mid = (l + r) / 2
          if nums[mid] > nums[r]:
              l = mid + 1
          elif nums[mid] < nums[l]:
              r = mid
          else:
              l += 1
      return nums[l]
masked: def sample_funcname ( var_0 ) :
      var_1 , var_2 = 0 , len ( var_0 ) - 1
      while var_1 < var_2 and var_0 [ var_1 ] >= var_0 [ 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_1 ] :
              var_2 = var_3
          else :
              var_1 += 1
      return var_0 [ var_1 ]
  