algorithm/leetcode-master
1
0
Fork 0
mirror of https://github.com/youngyangyang04/leetcode-master.git synced 2025-07-22 06:52:49 +08:00
Code Issues Packages Projects Releases Wiki Activity

Update 0454.四数相加II.md

Browse Source 
修改 Java 语言版本代码，让 HashMap 相关操作更简洁
This commit is contained in:
Winson Huang
2023-04-18 21:07:54 +08:00
committed by GitHub
parent 5b4adbdbca
commit b7ea55c93b
1 changed files with 3 additions and 10 deletions
Download Patch File Download Diff File Expand all files Collapse all files

13
problems/0454.四数相加II.md
View File

@ -102,21 +102,14 @@ class Solution {
//统计两个数组中的元素之和，同时统计出现的次数，放入map //统计两个数组中的元素之和，同时统计出现的次数，放入map
for (int i : nums1) { for (int i : nums1) {
for (int j : nums2) { for (int j : nums2) {
int tmp = map.getOrDefault(i + j, 0); int sum = i + j;
if (tmp == 0) { map.put(sum, map.getOrDefault(sum, 0) + 1);
map.put(i + j, 1);
} else {
map.replace(i + j, tmp + 1);
}
} }
} }
//统计剩余的两个元素的和，在map中找是否存在相加为0的情况，同时记录次数 //统计剩余的两个元素的和，在map中找是否存在相加为0的情况，同时记录次数
for (int i : nums3) { for (int i : nums3) {
for (int j : nums4) { for (int j : nums4) {
int tmp = map.getOrDefault(0 - i - j, 0); res += map.getOrDefault(0 - i - j, 0);
if (tmp != 0) {
res += tmp;
}
} }
} }
return res; return res;