哈希表 Ⅱ
454.四数相加II
int fourSumCount(vector<int>& nums1, vector<int>& nums2, vector<int>& nums3, vector<int>& nums4)
{
unordered_map<int, int> map;
int count = 0;
for (auto a : nums1)
for (auto b : nums2)
map[a+b]++;
for (auto c : nums3)
{
for (auto d : nums4)
{
auto target = 0 - (c+d);
if (map.find(target) != map.end())
count += map[target];
}
}
return count;
}
15. 三数之和
使用哈希表很麻烦,使用双指针
vector<vector<int>> threeSum(vector<int>& nums)
{
vector<vector<int>> res;
sort(nums.begin(), nums.end());
for (int i = 0; i < nums.size(); i++)
{
if (nums[i] > 0) return res;
if (i > 0 && nums[i] == nums[i - 1]) continue;
auto L = i + 1;
auto R = nums.size() - 1;
while(L < R)
{
if (nums[i] + nums[L] + nums[R] > 0) R--;
else if (nums[i] + nums[L] + nums[R] < 0) L++;
else if (nums[i] + nums[L] + nums[R] == 0)
{
res.push_back(vector<int>{nums[i], nums[L], nums[R]});
while(L < R && nums[R] == nums[R - 1]) {R--;}
while(L < R && nums[L] == nums[L + 1]) {L++;}
R--;
L++;
}
}
}
return res;
}
18. 四数之和
- long
vector<vector<int>> fourSum(vector<int>& nums, int target)
{
vector<vector<int>> res;
sort(nums.begin(), nums.end());
for (int k = 0; k < nums.size(); k++)
{
if (nums[k] > target && nums[k] > 0 && target > 0) break;
if (k > 0 && nums[k] == nums[k - 1]) continue;
for (int i = k + 1; i < nums.size(); i++)
{
if (nums[k] + nums[i] > target && nums[k] + nums[i] > 0) break;
if (i > k + 1 && nums[i] == nums[i - 1]) continue;
auto L = i + 1;
auto R = nums.size() - 1;
while(L < R)
{
if ((long)nums[k] + nums[i] + nums[L] + nums[R] > target) R--;
else if ((long)nums[k] + nums[i] + nums[L] + nums[R] < target) L++;
else if ((long)nums[k] + nums[i] + nums[L] + nums[R] == target)
{
res.push_back(vector<int>{nums[k], nums[i], nums[L], nums[R]});
while(L < R && nums[L] == nums[L + 1]) {L++;}
while(L < R && nums[R] == nums[R - 1]) {R--;}
R--;
L++;
}
}
}
}
return res;
}