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

Update 0001.两数之和.md

Browse Source
This commit is contained in:
buptz2b
2025-02-04 22:00:18 +08:00
committed by GitHub
parent 861c770ae2
commit 3b2373d35f
1 changed files with 6 additions and 7 deletions
Download Patch File Download Diff File Expand all files Collapse all files

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

@ -287,17 +287,16 @@ func twoSum(nums []int, target int) []int {
``` ```
```go ```go
// 使用map方式解题，降低时间复杂度
func twoSum(nums []int, target int) []int { func twoSum(nums []int, target int) []int {
m := make(map[int]int) m := make(map[int]int)
for index, val := range nums { for i, num := range nums {
if preIndex, ok := m[target-val]; ok { complement := target - num
return []int{preIndex, index} if index, found := m[complement]; found {
} else { return []int{index, i}
m[val] = index
} }
m[num] = i
} }
return []int{} return nil // 返回空数组 nil 代替空切片
} }
``` ```