leetcode - 15.3Sum

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.

Notes:

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]
]

Solution:

  public List<List<Integer>> threeSum(int[] num) {
        Arrays.sort(num);
        List<List<Integer>> result = new LinkedList<>();
        for (int i = 0; i < num.length - 2; i++) {
            if (i == 0 || (i > 0 && num[i] != num[i - 1])) {
                int begin = i + 1;
                int end = num.length - 1;
                int sum = 0 - num[i];
                while (begin < end) {
                    if (num[begin] + num[end] == sum) {
                        result.add(Arrays.asList(num[i], num[begin], num[end]));
                        while (begin < end && num[begin] == num[begin + 1])
                            begin++;
                        while (begin < end && num[end] == num[end - 1])
                            end--;
                        begin++;
                        end--;
                    } else if (num[begin] + num[end] < sum) {
                        begin++;
                    } else {
                        end--;
                    }
                }
            }
        }
        return result;
    }