给定一个包含 n 个整数的数组 nums 和一个目标值 target,判断 nums 中是否存在四个元素 a,b,c 和 d ,使得 a + b + c + d 的值与 target 相等?找出所有满足条件且不重复的四元组。
注意:
答案中不可以包含重复的四元组。
示例:
给定数组 nums = [1, 0, -1, 0, -2, 2],和 target = 0。
满足要求的四元组集合为:
[
[-1, 0, 0, 1],
[-2, -1, 1, 2],
[-2, 0, 0, 2]
]
class Solution {
public:
vector<vector<int>> fourSum(vector<int>& nums, int target) {
int n = nums.size();
vector<vector<int>> res;
if(n < 4)
return res;
sort(nums.begin() , nums.end());
unordered_map<int, vector<pair<int, int>>> hashtable;
for(int i = 0 ; i < n - 1 ; i = nextNumberIndex(nums, i))
for(int j = i + 1 ; j < n ; j = nextNumberIndex(nums, j))
hashtable[nums[i]+nums[j]].push_back(make_pair(nums[i], nums[j]));
for( int i = 0 ; i <= n - 4 ; i = nextNumberIndex(nums, i) )
for (int j = i + 1; j <= n - 3; j = nextNumberIndex(nums, j)) {
int t = target - nums[i] - nums[j];
if( nums[j+1] + nums[j+2] > t || nums[n-1] + nums[n-2] < t)
continue;
if(hashtable.find(t) == hashtable.end())
continue;
vector<pair<int,int>>::iterator iter =
lower_bound(hashtable[t].begin(), hashtable[t].end(), make_pair(nums[j+1], nums[j+1]));
for(; iter != hashtable[t].end() ; iter ++)
res.push_back({nums[i], nums[j], iter->first, iter->second});
}
return res;
}
private:
int nextNumberIndex( const vector<int> &nums , int index ){
for( int i = index + 1 ; i < nums.size() ; i ++ )
if( nums[i] != nums[index] )
return i;
return nums.size();
}
int preNumberIndex( const vector<int> &nums , int index ){
for( int i = index-1 ; i >= 0 ; i -- )
if( nums[i] != nums[index] )
return i;
return -1;
}
};