[LeetCode] 4Sum Solution

Given an array S of n integers, are there elements a, b, c and d in S such that a + b + c + d = target?

Find all unique quadruplets in the array which gives the sum of target.

Note: 

*Elements in a quadruplet (a, b, c, d) must be in non-descending order.(ie a <=  b <= c <= d)

*The solution set must not contain duplicate quadruplets.

For example, given array S = {1 0 -1 0 -2 2} and target = 0.

A solution set is:

(-1, 0, 0, 1) (-2, -1, 1, 2) (-2, 0, 0, 2)

----------------------------------Accepted O(n^3)--------------------------------------------

public class Solution {
    public ArrayList<ArrayList<Integer>> fourSum(int[] num, int target) {
        ArrayList<ArrayList<Integer>> result = new ArrayList<ArrayList<Integer>>();
        if(num == null || num.length < 4) return result;
        
        HashSet<ArrayList<Integer>> hashSet = new HashSet<ArrayList<Integer>>();
        
        Arrays.sort(num);
        int len = num.length;
        for(int i = 0; i < len - 3; i++)
        {
           // if(num[i] > target) return result;
            for(int j = i + 1; j < len - 2; j++)
            {
                //if(num[i] + num[j] > target) return result;
                
                int k = j + 1;
                int l = len - 1;
                
                while(k < l)
                {
                    int sum = num[i] + num[j] + num[k] + num[l];
                    
                    if(sum > target){
                        l--;
                    }else if(sum < target){
                        k++;
                    }else if(sum == target){
                        ArrayList<Integer> arr = new ArrayList<Integer>();
                        arr.add(num[i]);
                        arr.add(num[j]);
                        arr.add(num[k]);
                        arr.add(num[l]);
                        
                        if(!hashSet.contains(arr)){
                            hashSet.add(arr);
                            result.add(arr);
                        }
                        k++;
                        l--;
                    }
                }
            }
            
        }
       return result; 
    }
}

---Wrong answer: 总是缺少一个中间的item------------------------------------------

public class Solution {
    public ArrayList<ArrayList<Integer>> fourSum(int[] num, int target) {
        ArrayList<ArrayList<Integer>> result = new ArrayList<ArrayList<Integer>>();
        if(num == null && num.length < 4) return result;
        
        HashSet<ArrayList<Integer>> hashSet = new HashSet<ArrayList<Integer>>();
        
        Arrays.sort(num);
        int length = num.length;
        for(int i = 0; i < length - 3; i++)
        {
            if(num[i] > target) return result;
            for(int j = i + 1; j < length - 2; j++)
            {
                if(num[i] + num[j] > target) return result;
                
                int value = target - (num[i] + num[j]);
                
                int front = j + 1;
                int tail = length - 1;
                while(front < tail)
                {
                    ArrayList<Integer> arr = new ArrayList<Integer>();
                    int valTarget = num[front] + num[tail];
                    if(valTarget == target)
                    {
                        arr.add(num[i]);
                        arr.add(num[j]);
                        arr.add(num[front]);
                        arr.add(num[tail]);
                        
                        if(!hashSet.contains(arr))
                        {
                            hashSet.add(arr);
                            result.add(arr);
                        }
                        front++;
                        tail--;
                        
                    } else if(valTarget < target){
                        front++;
                    } else if(valTarget > target){
                        tail--;
                    }
                    
                }
            }
        }
        return result;
    }
    
}

--------------------------------Time Limit Exceeded---------------------------------------------

public class Solution {
    public ArrayList<ArrayList<Integer>> fourSum(int[] num, int target) {
        ArrayList<ArrayList<Integer>> result = new ArrayList<ArrayList<Integer>>();
        if(num == null && num.length < 4) return result;
        
        Arrays.sort(num);
        int length = num.length;
        for(int i = 0; i < length - 3; i++)
        {
            if(num[i] > target) return result;
            while(i < length - 3 && num[i] == num[i + 1])
            {
                continue;
            }
            
            for(int j = i + 1; j < length - 2; j++)
            {
                while(j < length - 2 && num[j] == num[j + 1])
                {
                    continue;
                }
                
                if(num[i] + num[j] > target) return result;
                
                int value = target - (num[i] + num[j]);
                
                int front = j + 1;
                int tail = length - 1;
                while(front < tail)
                {
                    ArrayList<Integer> arr = new ArrayList<Integer>();
                    int valTarget = num[front] + num[tail];
                    if(valTarget == value)
                    {
                        arr.add(num[i]);
                        arr.add(num[j]);
                        arr.add(num[front]);
                        arr.add(num[tail]);
                        
                        result.add(arr);
                        
                        front++;
                        tail--;
                        
                        while(front < tail && num[front] == num[front + 1]) 
                            front++;
                        
                        while(front < tail && num[tail] == num[tail - 1])
                            tail--;
                    } else if(valTarget < value){
                        front++;
                    } else{
                        tail--;
                    }
                    
                }
            }
        }
        return result;
    }
    
}