leetcode -- 15. 3Sum

题目描述

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

AC代码

代码借鉴自 leetcode

class Solution {
    public List<List<Integer>> threeSum(int[] nums) {
        ArrayList<ArrayList<Integer>> resList = new ArrayList();
        if(nums == null || nums.length < 3) return resList;
        Arrays.sort(nums); 
        for(int i = 0;i < nums.length - 2;i++){
            if(i > 0 && nums[i] == nums[i - 1]) continue;
            int low = i + 1,high = nums.length - 1;
            while(low < high){
                if(nums[low] + nums[high] == -nums[i]){
                    resList.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] < -nums[i]) low++;
                else high--;
        }
            return resList;
    }
}