Given four integer arrays nums1
, nums2
, nums3
, and nums4
all of length n
, return the number of tuples (i, j, k, l)
such that:
0 <= i, j, k, l < n
nums1[i] + nums2[j] + nums3[k] + nums4[l] == 0
Example 1:
Input: nums1 = [1,2], nums2 = [-2,-1], nums3 = [-1,2], nums4 = [0,2] Output: 2 Explanation: The two tuples are: 1. (0, 0, 0, 1) -> nums1[0] + nums2[0] + nums3[0] + nums4[1] = 1 + (-2) + (-1) + 2 = 0 2. (1, 1, 0, 0) -> nums1[1] + nums2[1] + nums3[0] + nums4[0] = 2 + (-1) + (-1) + 0 = 0
Example 2:
Input: nums1 = [0], nums2 = [0], nums3 = [0], nums4 = [0] Output: 1
Constraints:
n == nums1.length
n == nums2.length
n == nums3.length
n == nums4.length
1 <= n <= 200
-228 <= nums1[i], nums2[i], nums3[i], nums4[i] <= 228
class Solution {
public:
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){
int target=0-(c+d);
if(map.find(target)!=map.end()){
count+=map[target];
}
}
}
return count;
}
};
注意:
1.为什么想到用哈希表map?
因为在这道题中,需要统计四个数相加为0的四元组,同时还需要记录出现的次数
2.count+=map[target]?
假设a[1]+b[2]=5,a[2]+b[3]=5,c[1]+d[2]=-5,此时出现了两个四元组,所以此时count+=2,注意不是简单的count+=1
3.key是什么?value呢?
key是元素的数值,value是四数之和为0出现的次数。