leetcode -- 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 int threeSumClosest(int[] num, int target) {
// Start typing your Java solution below
// DO NOT write main() function
Arrays.sort(num);
int result = 0;
int lastAbs = 65536;
int len = num.length;
for (int i = 0; i < len; i++) {
int start = i + 1;
int end = len - 1;
while (start < end) {
if (num[i] + num[start] + num[end] == target) {
lastAbs = 0;
result = target;
start++;
end--;
return result;
}
if (num[i] + num[start] + num[end] > target) {
if (Math.abs(num[i] + num[start] + num[end] - target) < lastAbs) {
lastAbs = Math.abs(num[i] + num[start] + num[end] - target);
result = num[i] + num[start] + num[end];
}
end--;
}

if (num[i] + num[start] + num[end] < target) {
if (Math.abs(num[i] + num[start] + num[end] - target) < lastAbs) {
lastAbs = Math.abs(num[i] + num[start] + num[end]
- target);
result = num[i] + num[start] + num[end];
}
start++;
}

}
}
return result;
}