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: 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://leetcode.com/problems/4sum/
题目大意:给定一个数组,求数组中四个数(不重复)能构成和为target的所有集合(集合内数值从小到大排序,而且集合不能重复)。
思路:其实思路跟LeetCode第15题思路差不多,先对给定的数组从小到大排个序,我们先确定集合内最小的那个数nums[i],其中 0 < i < n - 3,再确定第二小的数nums[j],其中 0 < j < n - 2,然后我们用一个左指针left(下标为j+1,,即集合最小值的下一个),一个右指针right(下标为n-1,即最大一个值),当四个数之和小于target时,左指针右移一位;但四个数之和大于target时,右指针左移一位;当四个数之和等于target时,记录下当前值,左指针右移,右指针左移,以此类推。
注意点:当数组中出现多个同样数值,要注意除重,除重步骤代码有标出。
附上代码:
class Solution {
public:
vector<vector<int>> fourSum(vector<int>& nums, int target) {
vector < vector <int> > ans ;
ans.clear() ;
int n = nums.size() , left , right , sum ;
sort ( nums.begin() , nums.end() ) ;
for ( int i = 0 ; i < n - 3 ; i ++ )
{
if ( i && nums[i] == nums[i-1] )//除重
continue ;
for ( int j = i + 1 ; j < n - 2 ; j ++ )
{
if ( j > i + 1 && nums[j] == nums[j-1] )
continue ;
left = j + 1 ;
right = n - 1 ;
while ( left < right )
{
sum = nums[left] + nums[right] + nums[i] + nums[j] ;
if ( sum == target )
{
ans.push_back ( { nums[i] , nums[j] , nums[left] , nums[right] } ) ;
while ( ++ left < right && nums[left] == nums[left-1] ) ;//除重
while ( left < -- right && nums[right] == nums[right+1] ) ;//除重
}
else if ( sum < target )
while ( ++ left < right && nums[left] == nums[left-1] ) ;//除重
else
while ( left < -- right && nums[right] == nums[right+1] ) ;//除重
}
}
}
return ans ;
}
};