comefrom: <qiyuangong>016_3Sum_Closest_1.py
code: def threeSumClosest( nums, target):
      ls = len(nums)
      sort_nums = sorted(nums)
      res = nums[0] + nums[1] + nums[2]
      for i in range(ls - 2):
          j, k = i + 1, ls - 1
          while j < k:
              temp = sort_nums[i] + sort_nums[j] + sort_nums[k]
              if abs(target - temp) < abs(target - res):
                  res = temp
              if temp < target:
                  j += 1
              else:
                  k -= 1
      return res
masked: def sample_funcname ( var_0 , var_1 ) :
      var_3 = len ( var_0 )
      var_5 = sorted ( var_0 )
      var_9 = var_0 [ 0 ] + var_0 [ 1 ] + var_0 [ 2 ]
      for var_11 in range ( var_3 - 2 ) :
          var_12 , var_13 = var_11 + 1 , var_3 - 1
          while var_12 < var_13 :
              var_14 = var_5 [ var_11 ] + var_5 [ var_12 ] + var_5 [ var_13 ]
              if abs ( var_1 - var_14 ) < abs ( var_1 - var_9 ) :
                  var_9 = var_14
              if var_14 < var_1 :
                  var_12 += 1
              else :
                  var_13 -= 1
      return var_9
  