书接上回,上次two_sum,这次是three_sum。
题目要求:
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]
]
整体思路就是先对其进行排序(从小到大也好,从大到小也好,这里是从小到大),最外层对数组遍历一遍,每次都拿到第一个元素nums[i],这里有俩个坐标值是begin和end,begin初始值是i+1,end为length-1,然后求值sum=nums[i] + nums[begin] + nums[end]; 如果结果sum小于零说明值偏小,那么将begin加一(使总值变大),如果sum大于零那么将end减一(使总值变小),内部循环的结果只有俩种可能:1、找到总值为0的三个所需结果,或者不满足begin
List<List<Integer>> result = new ArrayList<List<Integer>>();
int length = nums.length;
if(length < 3) {
return result;
}
//从小到大
Arrays.sort(nums);
for(int i=0;i<nums.length-2;i++) {
int begin = i+1;
int end = length - 1;
if(i>0 && nums[i]==nums[i-1])
continue;
while (begin < end) {
if (begin>i+1 && nums[begin]== nums[begin-1])
{
begin++;
continue;
}
//nums[end]和nums[end+1]相等,避免重复
if (end<length-1 && nums[end] == nums[end+1])
{
end--;
continue;
}
int sum = nums[i] + nums[begin] + nums[end];
if(sum<0) {
begin++;
} else if(sum>0) {
end--;
} else {
//等于零
List<Integer> list = new ArrayList<Integer>();
list.add(nums[i]);
list.add(nums[begin]);
list.add(nums[end]);
result.add(list);
begin++;
}
}
}
return result;