mirror of
https://github.com/krahets/hello-algo.git
synced 2025-07-26 20:04:47 +08:00
Refactor the articles related to searching algorithm. Add the chapter of binary search. Add the section of searching algorithm revisited. (#464)
This commit is contained in:
24
codes/go/chapter_searching/leetcode_two_sum_test.go
Normal file
24
codes/go/chapter_searching/leetcode_two_sum_test.go
Normal file
@ -0,0 +1,24 @@
|
||||
// File: leetcode_two_sum.go
|
||||
// Created Time: 2022-11-25
|
||||
// Author: reanon (793584285@qq.com)
|
||||
|
||||
package chapter_searching
|
||||
|
||||
import (
|
||||
"fmt"
|
||||
"testing"
|
||||
)
|
||||
|
||||
func TestTwoSum(t *testing.T) {
|
||||
// ======= Test Case =======
|
||||
nums := []int{2, 7, 11, 15}
|
||||
target := 9
|
||||
|
||||
// ====== Driver Code ======
|
||||
// 方法一:暴力解法
|
||||
res := twoSumBruteForce(nums, target)
|
||||
fmt.Println("方法一 res =", res)
|
||||
// 方法二:哈希表
|
||||
res = twoSumHashTable(nums, target)
|
||||
fmt.Println("方法二 res =", res)
|
||||
}
|
Reference in New Issue
Block a user