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]
]
思路:
1.排序
2.确定一个基数
3.剩下两个数类似sum2方法求解

class Solution {
       public List<List<Integer>> threeSum(int[] nums) {
    Arrays.sort(nums);
        int length = nums.length;
        //
        List<List<Integer>> lists = new ArrayList<List<Integer>>();
        for (int i = 0; i < length - 1; i++) {
            if (i > 0 && nums[i] == nums[i-1]) continue;
            int left = i+1, right = length - 1;
            int current = -nums[i];
            while (left < right) {
                    //-1 -2 -2 -4 0 1 2 2 3 4
                if (nums[left] + nums[right] == current) {
                    lists.add(Arrays.asList(-current, nums[left], nums[right]));
                    while ( left <right && nums[left] == nums[left+1] ) left++;
                    while(left < right && nums[right] == nums[right-1] ) right--;
                    left++;
                    right--;
                } else if (nums[left] + nums[right] < current) {
                    while ( left <right && nums[left] == nums[left+1] ) left++;
                    left++;
                } else {
                    while(left < right && nums[right] == nums[right-1] ) right--;
                    right--;
                }
            }
        }
        return lists;
}


}