<awangdev>[lint]. 3 Sum Closest_1.java
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;
    }
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_10 = var_0 [ 0 ] + var_0 [ 1 ] + var_0 [ 2 ] ;
  for ( int var_11 = 0 ;
  var_11 < var_0 . length - 2 ;
  var_11 ++ ) {
    int var_12 = var_11 + 1 ;
    int var_13 = var_0 . length - 1 ;
    while ( var_12 < var_13 ) {
      long var_14 = var_0 [ var_12 ] + var_0 [ var_13 ] + var_0 [ var_11 ] ;
      if ( var_14 > var_1 ) {
        var_13 -- ;
      }
      else {
        var_12 ++ ;
      }
      var_10 = Math . abs ( var_14 - var_1 ) < Math . abs ( var_10 - var_1 ) ? var_14 : var_10 ;
    }
  }
  return ( int ) var_10 ;
}
