leetcode 15 : 3sum

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

解题思路

先将给出的数组排序，再将3sum问题转化为2sum问题，时间复杂度为O(n^2)

JAVA代码

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

总结

学会将复杂问题转化为多个简单问题。