给你四个整数数组 nums1
、nums2
、nums3
和 nums4
,数组长度都是 n
,请你计算有多少个元组 (i, j, k, l)
能满足:
0 <= i, j, k, l < n
nums1[i] + nums2[j] + nums3[k] + nums4[l] == 0
示例 1:
输入:nums1 = [1,2], nums2 = [-2,-1], nums3 = [-1,2], nums4 = [0,2] 输出:2 解释: 两个元组如下: 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
示例 2:
输入:nums1 = [0], nums2 = [0], nums3 = [0], nums4 = [0] 输出:1
提示:
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:
def fourSumCount(self, nums1: List[int], nums2: List[int], nums3: List[int], nums4: List[int]) -> int:
counter = Counter()
for a in nums1:
for b in nums2:
counter[a + b] += 1
ans = 0
for c in nums3:
for d in nums4:
ans += counter[-(c + d)]
return ans
class Solution {
public int fourSumCount(int[] nums1, int[] nums2, int[] nums3, int[] nums4) {
Map<Integer, Integer> counter = new HashMap<>();
for (int a : nums1) {
for (int b : nums2) {
counter.put(a + b, counter.getOrDefault(a + b, 0) + 1);
}
}
int ans = 0;
for (int c : nums3) {
for (int d : nums4) {
ans += counter.getOrDefault(-(c + d), 0);
}
}
return ans;
}
}
class Solution {
public:
int fourSumCount(vector<int>& nums1, vector<int>& nums2, vector<int>& nums3, vector<int>& nums4) {
unordered_map<int, int> counter;
for (int a : nums1)
for (int b : nums2)
++counter[a + b];
int ans = 0;
for (int c : nums3)
for (int d : nums4)
ans += counter[-(c + d)];
return ans;
}
};
func fourSumCount(nums1 []int, nums2 []int, nums3 []int, nums4 []int) int {
counter := make(map[int]int)
for _, a := range nums1 {
for _, b := range nums2 {
counter[a+b]++
}
}
ans := 0
for _, c := range nums3 {
for _, d := range nums4 {
ans += counter[-(c + d)]
}
}
return ans
}