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

思路：三指针算法，注意去重复; O(N^2);

class Solution {
    public List<List<Integer>> threeSum(int[] nums) {
        List<List<Integer>> lists = new ArrayList<List<Integer>>();
        Arrays.sort(nums);
        for(int i = 0; i < nums.length - 2; i++) {
            if(i - 1 >= 0 && nums[i] == nums[i - 1]) {
               continue; 
            }
            int j = i + 1; int k = nums.length - 1;
            while(j < k) {
                
                int sum = nums[i] + nums[j] + nums[k];
                if(sum == 0) {
                    List<Integer> list = new ArrayList<>();
                    list.add(nums[i]);
                    list.add(nums[j]);
                    list.add(nums[k]);
                    lists.add(list);
                    j++;
                    k--;
                    while(j < k && nums[j] == nums[j - 1] && nums[k] == nums[k + 1]) {
                        j++;
                        k--;
                    }
                } else if(sum < 0) {
                    j++;
                } else {
                    // sum > 0;
                    k--;
                }
            }
        }
        return lists;
    }
}

思路：a + b + c = 0, -> (b+c) = -a; 也就是转换为2Sum的问题；O(N^2); 注意去重复，a去重，同时b和c也要去重复；其实跟上面一模一样的思路；

class Solution {
    public List<List<Integer>> threeSum(int[] nums) {
        List<List<Integer>> lists = new ArrayList<List<Integer>>();
        if(nums == null || nums.length == 0) {
            return lists;
        }
        Arrays.sort(nums);
        for(int i = 0; i < nums.length - 2; i++) {
            if(i >= 1 && nums[i] == nums[i - 1]) {
                continue;
            }
            int target = -nums[i];
            twosum(nums, target, lists, i + 1, nums.length - 1);
        }
        return lists;
    }
    
    private void twosum(int[] nums, int target, List<List<Integer>> lists,
                       int start, int end) {
        if(start >= end) {
            return;
        }
        while(start < end) {
            int sum = nums[start] + nums[end];
            if(sum == target) {
                List<Integer> list = new ArrayList<Integer>();
                list.add(-target);
                list.add(nums[start]);
                list.add(nums[end]);
                lists.add(list);
                start++;
                end--;
                
                while(start < end && nums[start] == nums[start - 1]) {
                    start++;
                }
                
                while(start < end && nums[end] == nums[end + 1]) {
                    end--;
                }
            } else if(sum > target) {
                end--;
            } else {
                start++;
            }
        }
    }
}