题目地址
本题解原创,因为leetcode上没有题解,而我一遍过(思路),超过90%,就没有查其它算法,如果有,欢迎交流
思路主要就是先排序,然后用三个指针,i,j,k
i指针从头开始扫描,注意去重处理,
j指针从i+1开始,同时k从尾开始
里层循环当j k有交集的时候退出,这样保证不重复
注意一点,里层循环也要考虑去重问题,当更新了结果集后,j不能单纯自增,而要增加到不重复,否则最终结果会有重复
class Solution {
public List<List<Integer>> threeSum(int[] nums) {
Arrays.sort(nums);
List<List<Integer>> ans = new LinkedList<List<Integer>>();
int i = 0;
while(i < nums.length) {
while(i - 1 >= 0 && i < nums.length && nums[i - 1] == nums[i]) {
i ++;
}
int j = i + 1;
int k = nums.length - 1;
while(j < k) {
int temp = nums[i] + nums[j] + nums[k];
if(temp == 0) {
List<Integer> l = new LinkedList<Integer>();
l.add(nums[i]);
l.add(nums[j]);
l.add(nums[k]);
ans.add(l);
j ++;
while(j < k && nums[j - 1] == nums[j]) {
j ++;
}
}else if(temp < 0) {
j ++;
}else {
k --;
}
}
i ++;
}
return ans;
}
}
DFS
class Solution {
public List<List<Integer>> threeSum(int[] nums) {
return Sum(nums, 3, 0);
}
private List<List<Integer>> Sum(int[] nums, int n, int target) {
List<List<Integer>> res = new ArrayList<List<Integer>>();
if(nums.length < n) return res;
Arrays.sort(nums);
NSum(nums, 0, n, target, res, new ArrayList<Integer>());
return res;
}
private void NSum(int[] nums, int start, int n, int target, List<List<Integer>> res, List<Integer> cur) {
if(nums.length - start < n ||
nums[start] * n > target ||
nums[nums.length - 1] * n < target) {
return;
}
if(n == 2) {
int i = start;
int j = nums.length - 1;
while(i < j) {
int sum = nums[i] + nums[j];
if(sum == target) {
cur.add(nums[i]);
cur.add(nums[j]);
res.add(new ArrayList<Integer>(cur));
cur.remove(cur.size() - 1);
cur.remove(cur.size() - 1);
i ++;
j --;
while(i < j && nums[i] == nums[i - 1]) i ++;
while(i < j && nums[j] == nums[j + 1]) j --;
}else if( sum < target) {
i ++;
}else {
j --;
}
}
return ;
}
for(int i = start; i <= nums.length - n; i ++) {
if(i == start || nums[i - 1] != nums[i]) {
cur.add(nums[i]);
NSum(nums, i + 1, n - 1, target - nums[i], res, cur);
cur.remove(cur.size() - 1);
}
}
}
}