comefrom: <qiyuangong>035_Search_Insert_Position_1.py
code: def searchInsert( nums, target):
      min, pos = 0, 0
      max = len(nums) - 1
      while min <= max:
          
          pos = (max + min) / 2
          if nums[pos] == target:
              return pos
          elif nums[pos] > target:
              max = pos - 1
          else:
              min = pos + 1
      if min > pos:
          
          
          return pos + 1
      return pos
masked: def sample_funcname ( var_0 , var_1 ) :
      var_3 , var_4 = 0 , 0
      var_7 = len ( var_0 ) - 1
      while var_3 <= var_7 :
          var_4 = ( var_7 + var_3 ) / 2
          if var_0 [ var_4 ] == var_1 :
              return var_4
          elif var_0 [ var_4 ] > var_1 :
              var_7 = var_4 - 1
          else :
              var_3 = var_4 + 1
      if var_3 > var_4 :
          return var_4 + 1
      return var_4
  