LeetCode 15. 3Sum

Description

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

Solution

可以转化成两数之和来做

三个月前抄答案才写出来，现在自己写出来了，但是很多边角没通过一开始。。。

public List<List<Integer>> threeSum(int[] nums) {
        List<List<Integer>> res = new ArrayList<>();
        Arrays.sort(nums);
        for(int i = 0; i < nums.length - 2; ++i) {
            if(i != 0 && nums[i] == nums[i - 1]) {
                continue;
            }
            int[] re = new int[3];
            List<List<Integer>> r = two_sum(nums, 0 - nums[i], i);
            for(List<Integer> l : r)
                res.add(l);
        }
        return res;
    }

    public List<List<Integer>> two_sum(int[] nums, int target, int cur) {
        int low = cur + 1, high = nums.length - 1;
        List<List<Integer>> result = new ArrayList<>();
        while(true) {
            if(low >= high) {
                return result;
            } else if(nums[low] + nums[high] == target) {
                List<Integer> resu = new ArrayList<>();
                resu.add(nums[low]); resu.add(nums[high]); resu.add(nums[cur]); result.add(resu);
                while(low + 1 < high && nums[low] == nums[low + 1])
                    low++;
                low++; high--;
            } else if(nums[low] + nums[high] < target) {
                while(low + 1 < high && nums[low] == nums[low + 1])
                    low++;
                low++;
            } else if(nums[low] + nums[high] > target) {
                while(high - 1 > low && nums[high] == nums[high - 1])
                    high--;
                high--;
            }
        }
    }