@@ -0,0 +1,720 @@
+public class Solution %7B%0A    public int threeSumClosest(int%5B%5D num, int target) %7B%0A        Arrays.sort(num);%0A        %0A        int closest = num%5B0%5D + num%5B1%5D + num%5B2%5D;%0A        for(int i=0; i%3Cnum.length-2; i++) %7B%0A            int j=i+1, k=num.length-1;%0A            while(j %3C k) %7B%0A                int sum = num%5Bi%5D + num%5Bj%5D + num%5Bk%5D;%0A                if (Math.abs(sum-target) %3C Math.abs(closest-target)) %7B%0A                    closest = sum;%0A                %7D %0A                if (sum == target) %7B%0A                    return sum;%0A                %7D else if (sum %3C target) %7B%0A                    j++;%0A                %7D else %7B%0A                    k--;%0A                %7D%0A            %7D%0A        %7D%0A        %0A        return closest;%0A    %7D%0A%7D%0A

Create 3Sum_Closest.java