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

链接：https://oj.leetcode.com/problems/4sum/

描述：在数组中找四元组使得四个数字加起来等于target

解法：和3Sum一样，采用两边往中间夹的方式，O(n^3)的时间复杂度

solution by python:

O(n^3)的解法会超时

class Solution:
    # @return a list of lists of length 4, [[val1,val2,val3,val4]]
    def fourSum(self, num, target):
        num.sort()
        ans = []
        for i in range(len(num)-3):
            if i!=0 and num[i]==num[i-1]: continue
            for j in range(i+1, len(num)-2):
                if j!=i+1 and num[j]==num[j-1]: continue
                n = target-num[i]-num[j]
                low=j+1;high=len(num)-1
                while low < high:
                    if num[low]+num[high] == n:
                        ans.append([num[i],num[j],num[low],num[high]])
                        while low<high and num[low] == num[low+1]: low += 1
                        while low<high and num[high] == num[high-1]: high -= 1
                        low,high = low+1,high-1
                    elif num[low]+num[high] < n: low += 1
                    else: high -= 1
        return ans

采用哈希，O(n^2)的复杂度可以解决

class Solution:
    # @return a list of lists of length 4, [[val1,val2,val3,val4]]
    def fourSum(self, num, target):
        num.sort()
        ans=set();tdict={}
        for i in range(len(num)-1):
            for j in range(i+1,len(num)):
                n = num[i]+num[j]
                if n not in tdict:
                    tdict[n] = [(i,j)]
                else:
                    tdict[n].append((i,j))
        for i in range(len(num)):
            for j in range(i+1, len(num)-2):
                n = target-num[i]-num[j]
                if n in tdict:
                    for ele in tdict[n]:
                        if ele[0]>j: ans.add((num[i],num[j],num[ele[0]],num[ele[1]]))
        return [list(ele) for ele in ans]

solution by c++:

AC无压力

class Solution {
public:
    vector<vector<int> > fourSum(vector<int> &num, int target) {
        vector<vector<int> > ans;
        if(num.size() < 4) return ans;
        int len = num.size();
        sort(num.begin(), num.end());
        for(int i=0; i<len-3; i++){
            if(i != 0 && num[i] == num[i-1])
                continue;
            for(int j=i+1; j<len-2; j++){
                if(j!=i+1 && num[j] == num[j-1])
                    continue;
                int t = target-num[i]-num[j];
                int low = j+1, high = len-1;
                while(low < high){
                    int n = num[low]+num[high];
                    if(n == t){
                        vector<int> v(4);
                        v[0]=num[i]; v[1]=num[j];
                        v[2]=num[low]; v[3]=num[high];
                        ans.push_back(v);
                        do{
                            ++low;
                        }while(num[low]==num[low-1] && low<high);
                    } else if(n < t){
                        ++low;
                    }else {
                        --high;
                    }
                }
            }
        }
        return ans;
    }
};