题目:
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的全部序列,是2Sum的进阶版
思路:首先将数组排序,排序后遍历序列,控制住第一个数字,后两个数字从该数字的下一位和数组尾部寻找,如果这三个数的和小于0,第二个数向后移,反之第三个数前移,还要注意重复数字判断问题
public class Solution { public List<List<Integer>> threeSum(int[] nums) { Arrays.sort(nums); List<List<Integer>> result = new ArrayList<>(); for(int i = 0;i<nums.length-2;i++) { if((i==0)||(i!=0&&nums[i]!=nums[i-1])) { int lo = i+1; int hi = nums.length-1; int target = 0-nums[i]; while(lo<hi) { int middle = nums[lo]+nums[hi]; if(middle == target) { result.add(Arrays.asList(nums[i],nums[lo],nums[hi])); while(lo<hi && nums[lo+1]==nums[lo]) lo++; while(lo<hi && nums[hi-1]==nums[hi]) hi--; lo++; hi--; } else if(middle > target) hi--; else lo++; } } } return result; } }