【小熊刷题】3 Sum <Leetcode 15，Java>

Question

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)

*Difficulty: Medium
https://leetcode.com/problems/3sum/

##Solution
一开始说放在hashtable里面，但是还是超时了。于是wiki一下经典解决方法https://en.wikipedia.org/wiki/3SUM 依然超时。看了下以往的答案，还要避免重复，去掉重复之后终于accepted了。

public class Solution {
        public List<List<Integer>> threeSum(int[] nums) {
            //according to https://en.wikipedia.org/wiki/3SUM
            List<ArrayList<Integer>> r = new ArrayList<ArrayList<Integer>>();
            Arrays.sort(nums);
            for(int i = 0; i < nums.length-2 && nums[i] <= 0; i++){
                int a = nums[i];
                int start = i+1;
                int end = nums.length - 1;
                if (i > 0 && nums[i] == nums[i-1]) continue; // avoid duplicates
                while(start < end){
                    int b = nums[start];
                    int c = nums[end];
                    if(a+b+c == 0){
                        ArrayList<Integer> al = new ArrayList<>();
                        al.add(a); al.add(b); al.add(c);
                        start++; end--;
                        if(!r.contains(al))r.add(al);
                        while(start < end && nums[start] == nums[start-1]) start++;// avoid duplicates
                        while(start < end && nums[end] == nums[end+1]) end--;// avoid duplicates
                    }else if(a+b+c>0) end--;
                    else start++;
                }
            }
            return (List)r;
        }
}