/* 思路:将四个数的和转换为两两求和,先将两两之和的结果存到哈希表中,每个和都对应一个vector,用来存储数组中对应的位置。对哈希中每个值,在该表中寻找target-value,如果可以找到则把对应的vector交叉映射组合成一个四数数组,对每一个数组检查是否存在重复位置,对哈希中每个值,在该表中寻找target-value,如果可以找到则把对应的vector交叉映射组合成一个四数数组,对每一个数组检查是否存在重复位置,
存在则删除,不存在则加入pos二维数组,同时对pos去重(组合方式不同可能产生重复),最后把pos中每个位置对应在nums中的值取出并存入result二维数组,同样需要去重。关键的时间复杂度在交叉映射组合这部分,为O(N2)*/
class Solution {
public:
vector<vector<int>> fourSum(vector<int>& nums, int target) {
if (nums.size() == 0)
{
vector<vector<int>> noresult;
noresult.clear();
return noresult;
}
unordered_map<int, vector<int>> sum2;
for (int i = 0; i < nums.size() - 1; i++)
for (int j = i + 1; j < nums.size(); j++)
{
if (sum2.find(nums[i] + nums[j]) == sum2.end())
{
vector<int> pair_pos;
pair_pos.push_back(i);
pair_pos.push_back(j);
sum2.insert(make_pair(nums[i] + nums[j], pair_pos));
}
else
{
sum2[nums[i] + nums[j]].push_back(i);
sum2[nums[i] + nums[j]].push_back(j);
}
}
unordered_map<int, vector<int>> ::iterator sum2_it = sum2.begin();
vector<vector<int>> pos;
for (; sum2_it != sum2.end(); sum2_it++)
{
//cout << sum2_it->first << endl;
if (sum2.find(target - sum2_it->first) != sum2.end())
for (int i = 0; i < sum2_it->second.size(); i += 2)
for (int j = 0; j < sum2[target - sum2_it->first].size(); j += 2)
{
vector<int> tmp;
tmp.push_back(sum2_it->second[i]);
tmp.push_back(sum2_it->second[i + 1]);
tmp.push_back(sum2[target - sum2_it->first][j]);
tmp.push_back(sum2[target - sum2_it->first][j + 1]);
sort(tmp.begin(), tmp.end());
tmp.erase(unique(tmp.begin(), tmp.end()), tmp.end());
if (tmp.size() < 4)
continue;
else
pos.push_back(tmp);
}
}
sort(pos.begin(), pos.end());
pos.erase(unique(pos.begin(), pos.end()), pos.end());
if (pos.size() == 0)
{
vector<vector<int>> noresult;
noresult.clear();
return noresult;
}
vector<vector<int>> result;
for (int j = 0; j<pos.size(); j++)
{
vector<int> group;
for (int i = 0; i < pos[j].size(); i++)
group.push_back(nums[pos[j][i]]);
sort(group.begin(), group.end());
result.push_back(group);
}
sort(result.begin(), result.end());
result.erase(unique(result.begin(), result.end()), result.end());
return result;
}
};