Movatterモバイル変換


[0]ホーム

URL:


Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Sign up
Appearance settings

Commit57f0d92

Browse files
Update
1 parente830efb commit57f0d92

File tree

1 file changed

+1
-1
lines changed

1 file changed

+1
-1
lines changed

‎problems/哈希表总结.md

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -95,7 +95,7 @@ std::unordered_map 底层实现为哈希,std::map 和std::multimap 的底层
9595

9696
本题咋眼一看好像和[18. 四数之](https://mp.weixin.qq.com/s/r5cgZFu0tv4grBAexdcd8A)[15.三数之和](https://mp.weixin.qq.com/s/nQrcco8AZJV1pAOVjeIU_g)差不多,其实差很多!
9797

98-
**关键差别是本题为四个独立的数组,只要找到A[i] + B[j] + C[k] + D[l] = 0就可以,不用考虑重复问题,而[18.四数之](https://mp.weixin.qq.com/s/r5cgZFu0tv4grBAexdcd8A)[15.三数之和](https://mp.weixin.qq.com/s/nQrcco8AZJV1pAOVjeIU_g)是一个数组(集合)里找到和为0的组合,可就难很多了!**
98+
**关键差别是本题为四个独立的数组,只要找到A[i] + B[j] + C[k] + D[l] = 0就可以,不用考虑重复问题,而[18.四数之和](https://mp.weixin.qq.com/s/nQrcco8AZJV1pAOVjeIU_g)[15.三数之和](https://mp.weixin.qq.com/s/r5cgZFu0tv4grBAexdcd8A)是一个数组(集合)里找到和为0的组合,可就难很多了!**
9999

100100
用哈希法解决了两数之和,很多同学会感觉用哈希法也可以解决三数之和,四数之和。
101101

0 commit comments

Comments
 (0)

[8]ページ先頭

©2009-2025 Movatter.jp