Leetcode 16 3Sum Closest

       Given an array S of n integers, find three integers in
S such that the sum is closest to a given number, target. Return the sum of the three integers.

        You may assume that each input would have exactly one solution.

For example, given array S = {-1 2 1 -4}, and target = 1.

The sum that is closest to the target is 2. (-1 + 2 + 1 = 2).

public class Solution {
public int threeSumClosest(int[] nums, int target) {
long sum = 0;
if (nums.length <= 3){
for (int i = 0; i < nums.length; i++){
sum += nums[i];
}
return (int)sum;
}
else{
Arrays.sort(nums);
sum = Integer.MAX_VALUE;
int i = 0;
while(i < nums.length - 2) {
int j = i + 1;
int k = nums.length - 1;
while(j < k) {
int result = nums[i] + nums[j] + nums[k];
if (Math.abs(result-target) < Math.abs(sum-target))
sum = result;
if(result < target) j++;
else if(result > target) k--;
else
return target;
}
while(i < nums.length - 2 && nums[i] == nums[++i]);
}
return (int)sum;
}
}
}