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:
- Elements in a triplet (a,b,c) must be in non-descending order. (ie, a ≤ b ≤ c)
- 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)
注:本题中所说的不能重复是指不能出现set中有一模一样的集合,而非一个集合中不能有三个相同的元素。
对数组进行排序,遍历一遍元素,每次以该元素,加上该元素以后的两个元素(前面的已经在前面遍历时算过了,再加前面的会重复)判断是否为0。如果为0就判断hash中是否存在(判断结果集中是否已经有该组合),没有就加入。如果三数之和大于0,就使high--(因为已排序),小于0就low++。
Source
public class Solution {
public List<List<Integer>> threeSum(int[] num) {
List<List<Integer>> st = new ArrayList<List<Integer>>();
HashSet<ArrayList<Integer>> set = new HashSet<ArrayList<Integer>>();
if(num.length <= 2) return st;
Arrays.sort(num);
for(int i = 0; i < num.length - 1; i++){
int low = i + 1;
int high = num.length - 1;
while(low < high){
if(num[i] + num[low] + num[high] == 0){
ArrayList<Integer> a = new ArrayList<Integer>();
a.add(num[i]);
a.add(num[low]);
a.add(num[high]);
if(!set.contains(a)){
set.add(a);
st.add(a);
}
low ++;
high --;
}
else{
if(num[i] + num[low] + num[high] > 0){
high --;
}
if(num[i] + num[low] + num[high] < 0){
low ++;
}
}
}
}
return st;
}
}
Test
public static void main(String[] args){
int[] numbers = {-1, 0, 0, 0, 1, -1, 2};
List<List<Integer>> b = new Solution().threeSum(numbers);
System.out.println(b);
}