【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)

Java:

http://blog.csdn.net/linhuanmars/article/details/19711651

关于 i和j,因为two sum那个函数的实现是从0到end的，所以选取元素作为第三个是从后面选起，如果two sum的实现是从某个元素到最后，就应该是从前面往后扫了哈～

public class Solution {
    public ArrayList<ArrayList<Integer>> threeSum(int[] num) {
		ArrayList<ArrayList<Integer>> res = new ArrayList<ArrayList<Integer>>();
		if(num==null||num.length<=2) return res;
		Arrays.sort(num);
		for(int i=num.length-1;i>=2;i--)
		{
		    if(i<num.length-1&&num[i]==num[i+1]) continue;
		    ArrayList<ArrayList<Integer>> curRes = twoSum(num,i-1,-num[i]); //sum==0, so here is -num[i]
		    for(int j=0;j<curRes.size();j++)
		    {
		        curRes.get(j).add(num[i]);
		    }
		    res.addAll(curRes);
		}	
		return res;
    }
    private ArrayList<ArrayList<Integer>> twoSum(int[] num, int end, int target)
    {
        ArrayList<ArrayList<Integer>> res = new ArrayList<ArrayList<Integer>>();
        if(num==null||num.length<=1) return res;
		int l=0;
		int r=end;
		while(l<r)
		{
		    if(num[l]+num[r]==target)
		    {
		        ArrayList<Integer> item= new ArrayList<Integer>();
		        item.add(num[l]);
		        item.add(num[r]);
		        res.add(item);
		        l++;
		        r--;
		        while(l<r&&num[l]==num[l-1]) l++;
		        while(l<r&&num[r]==num[r+1]) r--;
		    }
		    else if(num[l]+num[r]>target){ 
		        r--;
		        
		    }
		    else
		    {
		        l++;
		    }
		}
		return res;
    }
}

水印人生：

public class Solution {
    public ArrayList<ArrayList<Integer>> threeSum(int[] num) {
		ArrayList<ArrayList<Integer>> result = new ArrayList<ArrayList<Integer>>();
		Arrays.sort(num);
		for (int i = 0; i < num.length - 2; ++i) {
			if (i > 0 && num[i] == num[i - 1]) {
				continue;
			}
			int j = i + 1;
			int k = num.length - 1;
			while (j < k) {
				if (num[i] + num[j] + num[k] > 0) {
					--k;
				} else if (num[i] + num[j] + num[k] < 0) {
					++j;
				} else {
					ArrayList<Integer> tmp = new ArrayList<Integer>();
					tmp.add(num[i]);
					tmp.add(num[j]);
					tmp.add(num[k]);
					result.add(tmp);
					--k;
					++j;
					while (j < k && num[j] == num[j - 1]) {
						++j;
					}
					while (j < k && num[k] == num[k + 1]) {
						--k;
					}
				}
			}
		}
		return result;
    }