comefrom: <qiyuangong>259_3Sum_Smaller_1.py
code: def binarySearch( nums, start, target):
      left, right = start, len(nums) - 1
      while left < right:
          mid = (left + right + 1) / 2
          if nums[mid] < target:
              
              left = mid
          else:
              right = mid - 1
      return left
masked: def sample_funcname ( var_0 , var_1 , var_2 ) :
      var_3 , var_6 = var_1 , len ( var_0 ) - 1
      while var_3 < var_6 :
          var_8 = ( var_3 + var_6 + 1 ) / 2
          if var_0 [ var_8 ] < var_2 :
              var_3 = var_8
          else :
              var_6 = var_8 - 1
      return var_3
  