Leetcode #16

gistfile1.txt

public int threeSumClosest(int[] num, int target) {
        HashSet<Integer> partSum = new HashSet<Integer>();
        partSum.add(num[0]+num[1]);
        int result=num[0]+num[1]+num[2];
        for(int i=2; i<num.length; i++){
            for(int n: partSum){
                if(Math.abs(n+num[i]-target)<Math.abs(result-target)){
                    if(n+num[i] == target)
                        return target;
                    else result = n+num[i];
                }
            }
            for(int j=i-1; j>=0; j--){
                partSum.add(num[i]+num[j]);
            }
        }
        return result;
    }