LeetCode 18: 4Sum

最新推荐文章于 2022-02-27 14:50:19 发布

「已注销」

最新推荐文章于 2022-02-27 14:50:19 发布

阅读量3.4k

点赞数 1

分类专栏： LeetCode LeetCode算法分析文章标签： LeetCode 4Sum

本文链接：https://blog.csdn.net/sunao2002002/article/details/46335945

版权

LeetCode 同时被 2 个专栏收录

80 篇文章 0 订阅

订阅专栏

LeetCode算法分析

76 篇文章 22 订阅

订阅专栏

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)

代码如下：

class Solution {
public:
    vector<vector<int> > fourSum(vector<int> &num, int target) {
		vector<vector<int>> out;
		set<vector<int>> res;
		if (num.size() < 4)
			return out;
		sort(num.begin(), num.end());
		for (int i=0; i<num.size()-3; i++)
		{
		    
			for (int j =i+1;j<num.size()-2;j++)
			{
				int begin = j+1;
				int end = num.size()-1;
				while(begin < end){
					int sum = num[i] + num[j] + num[begin] + num[end];
					if (sum== target)
					{
						vector<int> tmp;
						tmp.push_back(num[i]);
						tmp.push_back(num[j]);
						tmp.push_back(num[begin]);
						tmp.push_back(num[end]);
						res.insert(tmp);
						begin++;
						end--;
					} 
					else if(sum < target)
					{
						begin++;
					}else{
						end--;
					}
				}
				
			}
		}
		 set<vector<int>>::iterator it = res.begin();  
        for(; it != res.end(); it++)  
            out.push_back(*it); 


	}
};