剑指LeetCode -- 第十五题 -- 三数之和 -- 中等

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