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.
package pack;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.HashSet;
import java.util.List;
/*
* 求三数和为0,遍历一个数,以它为定点,再转化为2Sum
*/
class Solution {
public List<List<Integer>> threeSum(int[] nums) {
Ar