forked from krahets/hello-algo
-
Notifications
You must be signed in to change notification settings - Fork 0
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
feat(chapter1): add go code to chapter1
1.add go code to chapter_computational_complexity 2.add go code to space_time_tradeoff.md 3. Indentation of Go code is tab in *.go , 4 spaces in *.md
- Loading branch information
Showing
5 changed files
with
93 additions
and
2 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
|
@@ -3,6 +3,7 @@ | |
|
||
# Editor | ||
.vscode/ | ||
.idea/ | ||
|
||
# mkdocs files | ||
site/ | ||
|
30 changes: 30 additions & 0 deletions
30
codes/go/chapter_computational_complexity/leetcode_two_sum.go
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,30 @@ | ||
// File: leetcode_two_sum.go | ||
// Created Time: 2022-11-25 | ||
// Author: reanon ([email protected]) | ||
|
||
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 | ||
} |
24 changes: 24 additions & 0 deletions
24
codes/go/chapter_computational_complexity/leetcode_two_sum_test.go
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,24 @@ | ||
// File: leetcode_two_sum.go | ||
// Created Time: 2022-11-25 | ||
// Author: reanon ([email protected]) | ||
|
||
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) | ||
} |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,3 @@ | ||
module github.com/krahets/hello-algo | ||
|
||
go 1.19 |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters