题目链接:https://leetcode.com/problems/3sum/
题目: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)
题意:给定一个数组,找出所有和为0的三个数,添加到ArrayList<Interger>中。要求这三个数按非降序排列,并且ArrayList不能重复。
示例代码:
public class Solution
{
public List<List<Integer>> threeSum(int[] nums)
{
List<List<Integer>> result=new ArrayList<List<Integer>>();
int length=nums.length;
if(nums==null||length<3)
return result;
//对目标数组按照升序排序
Arrays.sort(nums);
for(int i=0;i<length-2;i++)
{
//略过相同的数
if(i!=0&&nums[i]==nums[i-1])
{
continue;
}
int left=i+1;
int right=length-1;
//在nums[i]的右侧寻找两个数,值得它们为0
while(left<right)
{
int a1=nums[left];
int a2=nums[right];
int sum=a1+a2+nums[i];
if (sum==0)
{
ArrayList<Integer> list=new ArrayList<Integer>();
list.add(nums[i]);
list.add(a1);
list.add(a2);
result.add(list);
left++;
right--;
while (left < right && nums[left] == nums[left - 1])
{
//左侧略过相同的结果
left++;
}
while (left < right && nums[right] == nums[right + 1])
{
//右侧略过相同的结果
right--;
}
}
else if(sum>0) //sum>0,说明右侧的数大了,应该往左边移动
{
right--;
}
else //反之要往右边移动
{
left++;
}
}
}
return result;
}
}