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[] num, int target) {
        int closet=Integer.MAX_VALUE;
        int sum=0;
        int temp=0;
        int abs=0;
        if (num.length==0) return 0;
        Arrays.sort(num);
        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++) {
                    temp=num[i]+num[j]+num[k];
                    abs=Math.abs(temp-target);
                    if (temp==target)return temp;
                    if (abs<closet){
                        sum=temp;
                        closet=abs;
                    }
                    if (temp>target)break;
                }
            }
        }
        return sum;
    }
}