3 sums

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.

tricky的部分：do not contain duplicate 

public class Solution {
    public ArrayList<ArrayList<Integer>> threeSum(int[] num) {
        ArrayList<ArrayList<Integer>> result = new ArrayList<ArrayList<Integer>>();
        if(num.length<3) return result;
        Arrays.sort(num);
        for(int i=0; i<num.length-2; i++){                        //length-2
            if(i>0 && num[i] == num[i-1]) continue;
            int left = i+1;
            int right = num.length-1;
            while(left<right){
                int sum = num[i]+num[left]+num[right];
                if(sum>0){
                    right--;
                }
                else if (sum<0){
                    left++;
                }
                else{
                    ArrayList<Integer> ret = new ArrayList<Integer>();
                    ret.add(num[i]);
                    ret.add(num[left]);
                    ret.add(num[right]);
                  //  result.add((ArrayList<Integer>)ret.clone());
                  result.add(ret);
                    left++;
                    right--;
                    while(left<right && num[left] == num[left-1]){    //skip duplicate element
                        left++;
                    }
                    while(left<right && num[right] == num[right+1]){  //skip duplicate element
                        right--;
                    }
                }
            }
        }
       return result; 
    }
}