refactor 15

Author: fishercoder1534

src/main/java/com/fishercoder/solutions/_15.java

@@ -4,23 +4,6 @@
 import java.util.Arrays;
 import java.util.List;
 
-/**
- * 15. 3Sum
- *
- * Given an array S of n integers, are there elements a, b, c in S such that a + b + c = 0?
- * Find all unique triplets in the array which gives the sum of zero.
- *
- * Note: The solution set must not contain duplicate triplets.
-
- For example, given array S = [-1, 0, 1, 2, -1, -4],
-
- A solution set is:
- [
- [-1, 0, 1],
- [-1, -1, 2]
- ]
- */
-
 public class _15 {
 
     public static class Solution1 {