mirror of
https://github.com/krahets/hello-algo.git
synced 2025-07-19 03:55:50 +08:00
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
This commit is contained in:
@ -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
|
||||
}
|
Reference in New Issue
Block a user