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)

» Solve this problem

方法与3Sum相同，只是多枚举了一个数。

class Solution {
public:
    vector<vector<int> > fourSum(vector<int> &num, int target) {
        // Start typing your C/C++ solution below
        // DO NOT write int main() function
        sort(num.begin(), num.end());
        vector<vector<int> > ans;
        vector<int> temp;
        for (int i = 0; i < num.size(); i++) {
            if (i > 0 && num[i] == num[i - 1]) {
                continue;
            }
            for (int j = i + 1; j < num.size(); j++) {
                if (j - 1 > i && num[j] == num[j - 1]) {
                    continue;
                }                                
                for (int k = j + 1; k < num.size(); k++) {
                    if (k - 1 > j && num[k] == num[k - 1]) {
                		continue;
                	}
                	
                	int l = target - num[i] - num[j] - num[k];
                	int left = k + 1, right = num.size() - 1, mid = 0;
                	while (left <= right) {
	                    mid = (left + right) / 2;
    	                if (num[mid] > l) {
        	                right = mid - 1;
            	        } 
                    	else if (num[mid] == l) {
                        	temp.push_back(num[i]);
                        	temp.push_back(num[j]);
                        	temp.push_back(num[k]);
                        	temp.push_back(num[mid]);
                        	ans.push_back(temp);
                        	temp.clear();
                        	break;
                    	}
                    	else {
	                        left = mid + 1;
    	                }                
    	            }
                }                
            }
        }
        return ans;
    }
};