algorithm/leetcode-master
1
0
Fork 0
mirror of https://github.com/youngyangyang04/leetcode-master.git synced 2025-07-09 19:44:45 +08:00
Code Issues Packages Projects Releases Wiki Activity

Merge pull request #2171 from tlylt/patch-3

Browse Source 
Update 0001.两数之和.md
This commit is contained in:
程序员Carl
2023-07-25 10:02:16 +08:00
committed by GitHub
parent c848094594 873257dcd8
commit 3a99beeb9a
1 changed files with 1 additions and 1 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
problems/0001.两数之和.md
View File

@ -163,7 +163,7 @@ class Solution:
for index, value in enumerate(nums): for index, value in enumerate(nums):
if target - value in records: # 遍历当前元素，并在map中寻找是否有匹配的key if target - value in records: # 遍历当前元素，并在map中寻找是否有匹配的key
return [records[target- value], index] return [records[target- value], index]
records[value] = index # 遍历当前元素，并在map中寻找是否有匹配的key records[value] = index # 如果没找到匹配对，就把访问过的元素和下标加入到map中
return [] return []
``` ```
（版本二）使用集合 （版本二）使用集合