[leetcode] 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)

递归：judge small：Accepted! judge large: Time Limit Exceeded

[cpp]  view plain copy print ?

1. void fourSumHelper(vector<int> &num, int index, vector<int> &path, int cursum, int target, vector<vector<int>> &res)  
2.     {  
3.         if(path.size() >=4)  
4.         {  
5.             if(path.size() == 4 && cursum == target)  
6.             {  
7.                 res.push_back(path);  
8.                 return;  
9.             }else  
10.                 return;  
11.         }  
12.         for(int i = index; i < num.size(); i++)  
13.         {  
14.             path.push_back(num[i]);  
15.             cursum += num[i];  
16.             fourSumHelper(num,i+1,path,cursum,target,res);  
17.             path.pop_back();  
18.             cursum -= num[i];  
19.             while(i < num.size()-1 && num[i] == num[i+1])i++;  
20.         }  
21.     }  
22.     vector<vector<int> > fourSum(vector<int> &num, int target) {  
23.         // Start typing your C/C++ solution below  
24.         // DO NOT write int main() function  
25.         vector<vector<int>> res;  
26.         if(num.size()<4)return res;  
27.         sort(num.begin(), num.end());  
28.         vector<int> path;  
29.         fourSumHelper(num,0,path,0,target,res);  
30.         return res;  
31.     }  

2sum变形：Accepted!

[cpp]  view plain copy print ?

1. vector<vector<int> > fourSum(vector<int> &num, int target) {  
2.         // Note: The Solution object is instantiated only once.  
3.         vector<vector<int>> res;  
4.         int numlen = num.size();  
5.         if(num.size()<4)return res;  
6.           
7.         sort(num.begin(),num.end());  
8.         set<vector<int>> tmpres;  
9.         for(int i = 0; i < numlen; i++)  
10.         {  
11.             for(int j = i+1; j < numlen; j++)  
12.             {  
13.                 int begin = j+1;  
14.                 int end = numlen-1;  
15.                 while(begin < end)  
16.                 {  
17.                     int sum = num[i]+ num[j] + num[begin] + num[end];  
18.                     if(sum == target)  
19.                     {  
20.                         vector<int> tmp;  
21.                         tmp.push_back(num[i]);  
22.                         tmp.push_back(num[j]);  
23.                         tmp.push_back(num[begin]);  
24.                         tmp.push_back(num[end]);  
25.                         tmpres.insert(tmp);  
26.                         begin++;  
27.                         end--;  
28.                     }else if(sum<target)  
29.                         begin++;  
30.                     else  
31.                         end--;  
32.                 }  
33.             }  
34.         }  
35.         set<vector<int>>::iterator it = tmpres.begin();  
36.         for(; it != tmpres.end(); it++)  
37.             res.push_back(*it);  
38.         return res;  
39.     }