3Sum Closest Java

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).

Have you been asked this question in an interview? 

  Solution: Time O(n^2)
    same idea as 3 Sum
    find minimum difference: abs(sum-target)

public int threeSumClosest(int[] num, int target) {
        Arrays.sort(num);
        int min=Integer.MAX_VALUE;
        int result=0;
        int len=num.length;
        for(int i=0;i<len-2;i++){
              int start=i+1;
              int end=len-1;
            while(start<end){
                int sum=num[i]+num[start]+num[end];
                int diff=Math.abs(sum-target);
                if(diff<min){
                    min=diff;
                    result=sum;
                    System.out.println(min);
                    //start++;
                    //end--;
                }else if(target>sum){
                    start++;
                }else{
                    end--;
                }
            }
        }
        return result;
    }