leetcode 15. 3Sum（三个数之和）

Given an array nums of n integers, are there elements a, b, c in nums 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.

Example:

Given array nums = [-1, 0, 1, 2, -1, -4],

A solution set is:
[
[-1, 0, 1],
[-1, -1, 2]
]

给一个有重复数字的数组，问能否找出3个数字，使3个数字的和为0
而且结果中不能有重复的组合

思路：
遍历数组，每次选出一个数字后，剩下的用two sum
因为不能有重复的组合，所以考虑排序，跳过重复元素，注意two sum部分也要跳过重复元素

因为已经排好序，所以two sum部分用双指针

    public List<List<Integer>> threeSum(int[] nums) {
        List<List<Integer>> result = new ArrayList<List<Integer>>();
        if(nums == null || nums.length < 3) {
            return result;
        }
        
        int n = nums.length;
        
        Arrays.sort(nums);
        
        for(int i = 0; i < n; i++) {
            //去重
            if(i > 0 && nums[i] == nums[i-1]) {
                continue;
            }
            int sum = 0 - nums[i];
            //two sum
            int left = i + 1;
            int right = n - 1;
            while(left < right) {
                if(nums[left] + nums[right] == sum) {
                    result.add(Arrays.asList(nums[i], nums[left], nums[right]));
                    //去重
                    
                    while(left < right && nums[left+1] == nums[left]) {
                        left ++;
                    }
                    while(left < right && nums[right-1] == nums[right]) {
                        right --;
                    }    
                    left ++;
                    right --;
                } else if (nums[left] + nums[right] < sum) {
                    left ++;
                } else {
                    right --;
                }
            }
        }
        return result;
    }