Merge pull request #8 from Reanon/docs/support-golang-chapter1

feat(chapter1): add go code to chapter1
This commit is contained in:
Yudong Jin 2022-11-25 11:54:46 +08:00 committed by GitHub
commit 072890ef85
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23
5 changed files with 93 additions and 2 deletions

1
.gitignore vendored
View File

@ -3,6 +3,7 @@
# Editor # Editor
.vscode/ .vscode/
.idea/
# mkdocs files # mkdocs files
site/ site/

View File

@ -0,0 +1,30 @@
// File: leetcode_two_sum.go
// Created Time: 2022-11-25
// Author: reanon (793584285@qq.com)
package chapter_computational_complexity
// twoSumBruteForce
func twoSumBruteForce(nums []int, target int) []int {
size := len(nums)
for i := 0; i < size-1; i++ {
for j := i + 1; i < size; j++ {
if nums[i]+nums[j] == target {
return []int{i, j}
}
}
}
return nil
}
// twoSumHashTable
func twoSumHashTable(nums []int, target int) []int {
hashTable := map[int]int{}
for idx, val := range nums {
if preIdx, ok := hashTable[target-val]; ok {
return []int{preIdx, idx}
}
hashTable[val] = idx
}
return nil
}

View File

@ -0,0 +1,24 @@
// File: leetcode_two_sum.go
// Created Time: 2022-11-25
// Author: reanon (793584285@qq.com)
package chapter_computational_complexity
import (
"testing"
)
func TestTwoSum(t *testing.T) {
// ======= Test Case =======
nums := []int{2, 7, 11, 15}
target := 9
// ====== Driver Code ======
// 方法一:暴力解法
res := twoSumBruteForce(nums, target)
t.Log("brute force:", res)
// 方法二:哈希表
res = twoSumHashTable(nums, target)
t.Log("hash table:", res)
}

3
codes/go/go.mod Normal file
View File

@ -0,0 +1,3 @@
module github.com/krahets/hello-algo
go 1.19

View File

@ -33,7 +33,7 @@
=== "C++" === "C++"
```cpp title="leetcode_two_sum.cpp" ```cpp title="leetcode_two_sum.cpp"
``` ```
=== "Python" === "Python"
@ -42,6 +42,24 @@
``` ```
=== "Go"
```go title="leetcode_two_sum.go"
func twoSum(nums []int, target int) []int {
size := len(nums)
for i := 0; i < size-1; i++ {
for j := i + 1; i < size; j++ {
if nums[i]+nums[j] == target {
return []int{i, j}
}
}
}
return nil
}
```
### 方法二:辅助哈希表 ### 方法二:辅助哈希表
时间复杂度 $O(N)$ ,空间复杂度 $O(N)$ ,属于「空间换时间」。 时间复杂度 $O(N)$ ,空间复杂度 $O(N)$ ,属于「空间换时间」。
@ -69,7 +87,7 @@
=== "C++" === "C++"
```cpp title="leetcode_two_sum.cpp" ```cpp title="leetcode_two_sum.cpp"
``` ```
=== "Python" === "Python"
@ -77,3 +95,18 @@
```python title="leetcode_two_sum.py" ```python title="leetcode_two_sum.py"
``` ```
=== "Go"
```go title="leetcode_two_sum.go"
func twoSumHashTable(nums []int, target int) []int {
hashTable := map[int]int{}
for idx, val := range nums {
if preIdx, ok := hashTable[target-val]; ok {
return []int{preIdx, idx}
}
hashTable[val] = idx
}
return nil
}
```