We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
1 parent 3b77ec3 commit 6f1faafCopy full SHA for 6f1faaf
leetcode-solutions/0001-Two-Sum-两数之和.md
@@ -32,7 +32,7 @@ https://leetcode-cn.com/problems/two-sum/
32
33
下图以示例演示一下哈希表,将数组插入到哈希表中,查找给定的`key`,即可以在`O(1)` 的时间复杂度查找到,图中的a、b、c、d指的是哈希表的索引。
34
35
-
+<img width="676" alt="示例" src="https://user-images.githubusercontent.com/87517460/128287010-e268ab24-d3fd-495e-ad8c-16703ad4251e.png">
36
37
38
## Java代码
0 commit comments