public List<List<Integer>> threeSum(int[] nums) {
Arrays.sort(nums);
List<List<Integer>> resultlist=new ArrayList<List<Integer>>();
if(nums.length<3)
{
return resultlist;
}
for(int i=0;i<nums.length-2;i++)
{
if (i > 0 && nums[i] == nums[i - 1])
{
continue;
}
int j=i+1;
int k=nums.length-1;
int target=-nums[i];
while(j<k)
{
if(target==nums[j]+nums[k])
{
List<Integer> arraylist=new ArrayList();
arraylist.add((Integer)nums[i]);
arraylist.add((Integer)nums[j]);
arraylist.add((Integer)nums[k]);
resultlist.add(arraylist);
j++;
k--;
while (j < k && nums[j] == nums[j - 1]) j++;
while (j < k && nums[k] == nums[k + 1]) k--;
}
else if(nums[j]+nums[k]>target)
{
k--;
}
else if(nums[j]+nums[k]<target)
{
j++;
}
}
}
return resultlist;
}
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]]
第一次编程时出现了超时的问题:
class Solution { public List<List<Integer>> threeSum(int[] nums) { Arrays.sort(nums); List<List<Integer>> resultlist=new ArrayList<List<Integer>>(); if(nums.length<3) { return resultlist; } for(int i=0;i<nums.length-2;i++) { if(i!=0&&nums[i]==nums[i-1]) { continue; } for(int j=i+1;j<nums.length-1;j++) { if(j>i+1&&nums[j]==nums[j-1]) { continue; } int sum=nums[i]+nums[j]; int third=0-sum; for(int k=j+1;k<nums.length;k++) { if(nums[k]==third) { List<Integer> arraylist=new ArrayList(); arraylist.add((Integer)nums[i]); arraylist.add((Integer)nums[j]); arraylist.add((Integer)nums[k]); resultlist.add(arraylist); break; } } } } return resultlist; } }
最后通过学习,用了新的算法: