[LeetCode18]4Sum

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)

Analysis:

a little different with 3sum, taking 3sum method we just need another loop.

java

public List<List<Integer>> fourSum(int[] num, int target) {
                List<List<Integer>> result = new ArrayList<List<Integer>>();
        int len = num.length;
        if(len<=0) return result;
        Arrays.sort(num);
        for(int i=0;i<len;i++){
        	int target1 = target-num[i];
        	for(int j=i+1;j<len;j++){
        		int target2 = target1-num[j];
        		int start = j+1;
        		int end = len-1;
        		while(start<end){
        			if(num[start]+num[end]==target2){
        				ArrayList<Integer> solu = new ArrayList<>();
        				solu.add(num[i]);
        				solu.add(num[j]);
        				solu.add(num[start]);
        				solu.add(num[end]);
        				result.add(solu);
        				start++;
        				end--;
        				while(start<end && num[start]==num[start-1]) start++;
        				while(start<end && num[end]==num[end+1]) end--;
        			}else if(num[start]+num[end]>target2){
						end--;
					}else {
						start++;
					}
        		}
        		while(j<len-1 && num[j]==num[j+1]) j++;
        	}
        	while(i<len-1 && num[i]==num[i+1]) i++;
        }
        return result;
    }

c++

vector<vector<int> > fourSum(vector<int> &num, int target) {
        vector<vector<int>> result;
    sort(num.begin(), num.end());
    for(int i=0; i<num.size();i++){
        int target1 = target- num[i];
        for(int j=i+1; j<num.size();j++){
            int target2 = target1-num[j];
            int start = j+1;
            int end = num.size()-1;
            while(start<end){
                if(num[start]+num[end]==target2){
                    vector<int> solution;
                    solution.push_back(num[i]);
                    solution.push_back(num[j]);
                    solution.push_back(num[start]);
                    solution.push_back(num[end]);
                    result.push_back(solution);
                    start++, end--;
                    while(start<end && num[start] == num[start-1]) start++;
                    while(start<end && num[end] == num[end+1]) end--;
                }
                else if(num[start] + num[end] >target2)
                    end--;
                else
                    start++;
            }
            while(j<num.size() && num[j] == num[j+1]) j++;
        }
        while(i<num.size() && num[i] == num[i+1]) i++;
    }
    return result;
    }