mirror of
https://github.com/youngyangyang04/leetcode-master.git
synced 2025-07-21 22:51:07 +08:00
Update 0454.四数相加II.md
修改 Java 语言版本代码,让 HashMap 相关操作更简洁
This commit is contained in:
@ -102,21 +102,14 @@ class Solution {
|
||||
//统计两个数组中的元素之和,同时统计出现的次数,放入map
|
||||
for (int i : nums1) {
|
||||
for (int j : nums2) {
|
||||
int tmp = map.getOrDefault(i + j, 0);
|
||||
if (tmp == 0) {
|
||||
map.put(i + j, 1);
|
||||
} else {
|
||||
map.replace(i + j, tmp + 1);
|
||||
}
|
||||
int sum = i + j;
|
||||
map.put(sum, map.getOrDefault(sum, 0) + 1);
|
||||
}
|
||||
}
|
||||
//统计剩余的两个元素的和,在map中找是否存在相加为0的情况,同时记录次数
|
||||
for (int i : nums3) {
|
||||
for (int j : nums4) {
|
||||
int tmp = map.getOrDefault(0 - i - j, 0);
|
||||
if (tmp != 0) {
|
||||
res += tmp;
|
||||
}
|
||||
res += map.getOrDefault(0 - i - j, 0);
|
||||
}
|
||||
}
|
||||
return res;
|
||||
|
Reference in New Issue
Block a user