leetcode--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:

• Elements in a triplet (a,b,c) must be in non-descending order. (ie, a ≤ b ≤ c)
• 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) 

思路:先确定一个，然后利用Two Sum的做法查找其他两个，注意要查重

public class Solution {
    public List<List<Integer>> threeSum(int[] nums) {
        List<List<Integer>> result = new ArrayList<List<Integer>>();
		Arrays.sort(nums);
		int pre = -100000;
		for(int i=0;i<nums.length;i++){
			if(nums[i]!=pre){				
				int low = i+1;
				int high = nums.length-1;
				int pre_in = -100000;
				while(low<high){						
					if(nums[low]!=pre_in){							
						if(nums[low]+nums[high]==-nums[i]){
							List<Integer> list = new ArrayList<Integer>(); 
							list.add(nums[i]);list.add(nums[low]);list.add(nums[high]);
							result.add(list);
							pre_in = nums[low];
							low++;
							high--;
						}else if(nums[low]+nums[high]<-nums[i]){
							low++;
						}else{
							high--;
						}
					}else{
						low++;
					}
				}	
		    	pre = nums[i];
			}		
		}
	
		return result;
    }
}