Leetcode: 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的组合。要留意重复元素的情况。

public class Solution {
    public ArrayList<ArrayList<Integer>> threeSum(int[] num) {
        ArrayList<ArrayList<Integer>> result = new ArrayList<ArrayList<Integer>>();
        if (num == null || num.length < 3) {
            return result;
        }
        
        Arrays.sort(num);
        for (int i = 0; i < num.length - 2; i++) {
            if (i != 0 && num[i] == num[i - 1]) {
                continue;
            }
            int second = i + 1, third = num.length - 1;
            while (second < third) {
                int sum = num[second] + num[third] + num[i];
                if (sum == 0) {
                    ArrayList<Integer> item = new ArrayList<Integer>();
                    item.add(num[i]);
                    item.add(num[second]);
                    item.add(num[third]);
                    result.add(item);
                    second++;
                    third--;
                    while (second < third && num[second] == num[second - 1]) {
                        second++;
                    }
                    while (second < third && num[third] == num[third + 1]) {
                        third--;
                    }
                } else if (sum > 0) {
                    third--;
                } else {
                    second++;
                }
            }
            
        }
        
        return result;
    }
}