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 thearray 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]
]
public class Solution { List<List<Integer>> result = new ArrayList<List<Integer>>();//保存合法的数对 public List<List<Integer>> threeSum(int[] nums) { int length = nums.length; if(length < 3 || nums == null){//对数组的合法性判断 return result; } //1、先对nums数组进行排序(按照升序进行排序) Arrays.sort(nums); //2、然后再从两头开始,进行遍历查找 for(int i = 0; i < length - 2; i++){ if(i > 0 && nums[i] == nums[i - 1]){//出现相同的数字 continue; } int low = i + 1; int high = length - 1; while(low < high){ if(nums[low] + nums[high] + nums[i] > 0){//三个数的和大于0,则最大数下标 -- high--; }else if(nums[low] + nums[high] + nums[i] < 0){//三个数的和小于0,则最小数下标 ++ low++; }else{//三个数的和等于0,先将三个元素放入到临时表temp中,然后再将temp添加到result中 List<Integer> temp = new ArrayList<Integer>(); temp.add(nums[i]); temp.add(nums[low]); temp.add(nums[high]); result.add(temp); while(low < high && nums[low + 1] == nums[low]){//防止地位出现相等的情况 low++; } low++; while(low < high && nums[high - 1] == nums[high]){//防止高位出现相等的情况 high--; } high--; } } } return result; } }