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] ]
题目大意:给定一个整型数组,找到三个元素,和为0,返回这三个元素,要求返回的结果集不包含重复的方案。
解题思路:先给数组排序,然后从小到大开始遍历数组,每锁定一个元素a[i],然后通过双指针的方法找到两个元素a[j]和a[k],使得a[j]+a[k] = -a[i],这就是满足条件的一个方案。每次锁定一个元素a[i]并找到所有满足条件的a[j]和a[k]后,i++,然后j和k都从i的右边开始,而且注意处理相同的元素连续出现的情况,可以跳过重复的方案。
解题代码:(68ms,beats 98.61%)
class Solution {
public List<List<Integer>> threeSum(int[] nums) {
List<List<Integer>> res = new ArrayList<>();
Arrays.sort(nums);
int len = nums.length;
for (int i = 0; i < len; i++) {
int twoSum = 0 - nums[i];
int left = i + 1, right = len - 1;
while (left < right) {
if (nums[left] + nums[right] > twoSum) {
right--;
} else if (nums[left] + nums[right] < twoSum) {
left++;
} else {
res.add(Arrays.asList(nums[i], nums[left], nums[right]));
left++;
while (left < len && nums[left] == nums[left - 1])
left++;
right--;
while (right >= 0 && nums[right] == nums[right + 1])
right--;
}
}
while (i < len - 1 && nums[i] == nums[i + 1])
i++;
}
return res;
}
}