leetcode 15. 3Sum-CSDN博客

本文链接：https://blog.csdn.net/qq_38702697/article/details/93331033

博客围绕数组3Sum问题展开，即找出数组中所有和为0的唯一三元组。介绍可将3Sum问题转换为2Sum问题，采用双指针方法解决。先对数组排序，让指针移动有方向，遍历数组元素，讨论特定范围是否有数的和等于当前元素的负数。还提及处理重复性问题的方法。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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

tag: array, two pointers

method 1

可以将3sum问题转换为2sum问题，然后再用2sum的办法解决。这里使用两个指针的方法

先对数组排序，这是为了让指针更好地移动，让指针有方向

遍历每一个索引i上的数nums[i]，然后讨论i+1~length-1这个范围内是否有数的和等于nums[i]的负数

public List<List<Integer>> threeSum(int[] nums) {
    Arrays.sort(nums);
    List<List<Integer>> res = new ArrayList<>();

    for (int i = 0; i < nums.length-2; i++) {

        if (i == 0 || (i > 0 && nums[i] != nums[i-1])){
            int low = i+1, high = nums.length-1, sum = -nums[i];
            while (low < high){
                if (nums[low] + nums[high] == sum){
                    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 (nums[low] + nums[high] < sum) low++;
                else high--;
            }
        }
    }

    return res;
}