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)

思路

和2SUM的思路是一样的。可以先固定一个位置，然后通过2个指针来查找。其中，要注意的是，可能在附近有相同的数字，所以可以通过比较，把指针移动到不是相同数字的位置

代码

public class Solution {
    public ArrayList<ArrayList<Integer>> threeSum(int[] num) {
        
 ArrayList<ArrayList<Integer>> result = new ArrayList<ArrayList<Integer>>();
        Arrays.sort(num);
        
        if(num.length == 3 && num[0]+num[1]==-num[2])
        {
        	ArrayList<Integer> temp = new ArrayList<Integer>();
        	temp.add(num[0]);
        	temp.add(num[1]);
        	temp.add(num[2]);
        	result.add(temp );
        	return result;
        }

        for (int i = 0 ; i <= num.length-3 ; i ++)
        {
        	int begin = i+1;
        	int end = num.length-1;
        	while( begin < end)
        	{
        		if(num[begin]+num[end]+num[i]==0)
        		{
        			ArrayList<Integer> temp = new ArrayList<Integer>();
        			temp.add(num[i]);
        			temp.add(num[begin]);
        			temp.add(num[end]);
        			if(!result.contains(temp))
        			result.add(temp);
        			
        			begin++;
        			end--;
        			while(begin<end && num[begin]==num[begin-1])
        			{
        				begin++;
        			}
        			while(begin<end && num[end]==num[end+1])
        			{
        				end--;
        			}        			
        		}
        		else if(num[begin]+num[end]+num[i]<0)
        		{
        			begin++;
        		}
        		else
        		{
        			end--;
        		}
        	}
        }
        
        return result;
    }
}