algorithm/leetcode-master
1
0
Fork 0
mirror of https://github.com/youngyangyang04/leetcode-master.git synced 2025-07-11 04:54:51 +08:00
Code Issues Packages Projects Releases Wiki Activity

Update 0001.两数之和.md

Browse Source 
Fix Python solution comment
This commit is contained in:
Liu Yongliang
2023-07-08 07:25:59 +08:00
committed by GitHub
parent 5974c82aea
commit 873257dcd8
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

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