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 class Solution {    public int threeSumClosest(int[] nums, int target) {        int result = nums[0]+nums[1]+nums[2];Arrays.sort(nums);for(int i=0;i<nums.length;i++){int low = i+1;int high = nums.length-1;while(low<high){if(Math.abs(nums[low]+nums[high]+nums[i]-target)<Math.abs(result-target)){result = nums[low]+nums[high]+nums[i];}if(nums[low]+nums[high]==target-nums[i]){return target;}else if(nums[low]+nums[high]<target-nums[i]){low++;}else{high--;}}    }return result;    }}