3Sum - LeetCode

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

• Difficulty: Medium

找出数组中三个数之和为零的所有不重复情况。具体源码如下：

 public List<List<Integer>> threeSum(int[] nums) {
    List<List<Integer>> res = new ArrayList<>();
    Arrays.sort(nums);
    for (int i = 0; i + 2 < nums.length; i++) {
        if (i > 0 && nums[i] == nums[i - 1]) {              // 跳过相同的目标值
            continue;
        }
        int j = i + 1, k = nums.length - 1;  
        int target = -nums[i]; 
        while (j < k) {
            //通过目标值来寻找另外两个元素。
            if (nums[j] + nums[k] == target) {
                res.add(Arrays.asList(nums[i], nums[j], nums[k]));
                j++;
                k--;
                while (j < k && nums[j] == nums[j - 1]) j++;  // 跳过相同的情况
                while (j < k && nums[k] == nums[k + 1]) k--;  // 跳过相同的情况
            } else if (nums[j] + nums[k] > target) {
                k--;
            } else {
                j++;
            }
        }
    }
    return res;
}