015_LeetCode_15 3Sum 题解

Description:

---

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.
在列表中找到三个相加为0的元素

---

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

---

解：
先排序，然后一次遍历里面嵌套二分查找。比如计算第一个于0的差值，然后在第二个和最后一个元素中间二分查找使得加和等于该差值的两个值。

---

java代码：

---

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

        if(nums.length == 0 || nums[0] > 0)
            return res;

        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 = 0 - 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;

    }
}