LeetCoder - 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[] num, int target) {
        int mingap = Math.abs(num[0]+num[1]+num[2]-target);
        int sum = num[0] + num[1] + num[2];
        for(int i=0;i<num.length;i++) {
            for(int j=i+1;j<num.length;j++) {
                for(int k=j+1;k<num.length;k++) {
                    int sm = num[i] + num[j] + num[k];
                    int gap = Math.abs(sm-target);
                    if(gap<mingap) {
                        sum = sm;
                        mingap = gap;
                    }
                    if(gap==0) {
                        return sm;
                    }
                }
            }
        }
        return sum;
    }
}

public class Solution {
    public int threeSumClosest(int[] num, int target) {
        int result = num[0] + num[1] + num[num.length - 1];
        Arrays.sort(num);
        for (int i = 0; i < num.length - 2; i++) {
            int start = i + 1, end = num.length - 1;
            while (start < end) {
                int sum = num[i] + num[start] + num[end];
                if (sum > target) {
                    end--;
                } else {
                    start++;
                }
                if (Math.abs(sum - target) < Math.abs(result - target)) {
                    result = sum;
                }
            }
        }
        return result;
    }
}