comefrom: <awangdev>[lint]. 3 Sum Closest_1.java
code: public int threeSumClosest(int[] nums, int target) {
          if (nums == null || nums.length < 3) {
              return 0;
          }
          Arrays.sort(nums); 
          long result = nums[0] + nums[1] + nums[2];
          for (int i = 0; i < nums.length - 2; i++) {
              int start = i + 1;
              int end = nums.length - 1;
              while (start < end) {
                  long sum = nums[start] + nums[end] + nums[i];
                  if (sum > target) {
                      end--;
                  } else {
                      start++;
                  }
                  result = Math.abs(sum - target) < Math.abs(result - target) ? sum : result;
              }
          }
          return (int)result;
      }
masked: public int sample_funcname ( int [ ] var_0 , int var_1 ) {
    if ( var_0 == null || var_0 . length < 3 ) {
      return 0 ;
    }
    Arrays . sort ( var_0 ) ;
    long var_2 = var_0 [ 0 ] + var_0 [ 1 ] + var_0 [ 2 ] ;
    for ( int var_3 = 0 ;
    var_3 < var_0 . length - 2 ;
    var_3 ++ ) {
      int var_4 = var_3 + 1 ;
      int var_5 = var_0 . length - 1 ;
      while ( var_4 < var_5 ) {
        long var_6 = var_0 [ var_4 ] + var_0 [ var_5 ] + var_0 [ var_3 ] ;
        if ( var_6 > var_1 ) {
          var_5 -- ;
        }
        else {
          var_4 ++ ;
        }
        var_2 = Math . abs ( var_6 - var_1 ) < Math . abs ( var_2 - var_1 ) ? var_6 : var_2 ;
      }
    }
    return ( int ) var_2 ;
  }
  