数组中相加和为0的三元组

DESC:

题目描述

给出一个有n个元素的数组S，S中是否有元素a,b,c满足a+b+c=0？找出数组S中所有满足条件的三元组。

注意：

1. 三元组（a、b、c）中的元素必须按非降序排列。（即a≤b≤c）
2. 解集中不能包含重复的三元组。

例如，给定的数组 S = {-10 0 10 20 -10 -40},解集为(-10, 0, 10) (-10, -10, 20)

 

示例1

输入

[-2,0,1,1,2]

返回值

[[-2,0,2],[-2,1,1]]

 

CODE1:

JAVA:

import java.util.*;
public class Solution {
    public ArrayList<ArrayList<Integer>> threeSum(int[] num) {
        if (num == null || num.length < 3) {
            return new ArrayList<>(0);
        }
        Arrays.sort(num);
        ArrayList<ArrayList<Integer>> res = new ArrayList<>();
        Map<String, Object> unipMap = new HashMap();
        for (int i=0; i < num.length - 2; i++) {
            int now = -num[i];
            int m = i + 1;
            int n = num.length - 1;
            while (m < n) {
                int sum = num[m] + num[n];
                if (sum == now) {
                    StringBuilder sb = new StringBuilder();
                    sb.append(num[i]);
                    sb.append(num[m]);
                    sb.append(num[n]);
                    if (unipMap.containsKey(sb.toString())) {
                        m++;
                        continue;
                    }
                    ArrayList<Integer> temp = new ArrayList();
                    temp.add(num[i]);
                    temp.add(num[m]);
                    temp.add(num[n]);
                    res.add(temp);
                    m++;
                    unipMap.put(sb.toString(), 1);
                } else if (sum > now) {
                    n--;
                } else {
                    m++;
                }
            }
        }
        return res;
    }
}

 

NOTES1:

1. 双指针，固定一值，用双指针从边界查找另两值

 

CODE2:

JAVA:

import java.util.*;
public class Solution {
    public ArrayList<ArrayList<Integer>> threeSum(int[] num) {
        ArrayList<ArrayList<Integer>> res = new ArrayList();
        if (num == null || num.length == 0) {
            return res;
        }
        Arrays.sort(num);
        ArrayList<Integer> valList = new ArrayList();
        backTrack(res, 0, valList, 0, num, 0);
        return res;
    }
    
    private void backTrack(ArrayList<ArrayList<Integer>> res, int start, 
                           ArrayList<Integer> valList, int sum, int[] num, int target){
        if (sum == target && valList.size()==3) {
            res.add(new ArrayList<>(valList));
            return;
        } 
        if (start >= num.length || valList.size()>3) {
            return;
        }
        for (int i=start; i< num.length; i++) {
            if (i>start && num[i] == num[i-1]) {
                continue;
            }
            
            valList.add(num[i]);
            sum += num[i];
            if (sum > target) {
                valList.remove(valList.size()-1);
                break;
            }
            backTrack(res, i+1, valList, sum, num, target);
            sum -= num[i];
            valList.remove(valList.size()-1);
        }
    }
}

 

NOTES2:

1. 回溯，利用求数组中加和等于目标值的套路，只不过这里要求是三元组和；