@@ -0,0 +1,704 @@
+import java.util.Arrays;%0A%0Aclass Solution %7B%0A    public int threeSumClosest(int%5B%5D nums, int target) %7B%0A        int result = nums%5B0%5D + nums%5B1%5D + nums%5Bnums.length - 1%5D;%0A        Arrays.sort(nums);%0A        for (int i = 0; i %3C nums.length - 2; i++) %7B%0A            int low = i + 1, high = nums.length - 1;%0A            while (low %3C high) %7B%0A                int sum = nums%5Bi%5D + nums%5Blow%5D + nums%5Bhigh%5D;%0A                if (sum %3C target) %7B%0A                    low++;%0A                %7D else %7B%0A                    high--;%0A                %7D%0A                if (Math.abs(target - sum) %3C Math.abs(target - result)) %7B%0A                    result = sum;%0A                %7D%0A            %7D%0A        %7D%0A        return result;%0A    %7D%0A%7D%0A

16. 3Sum Closest