From 78901d868966f1b4c2e1405074ee66b2254d1ab5 Mon Sep 17 00:00:00 2001 From: chenshilong Date: Mon, 12 Dec 2022 16:36:29 +0800 Subject: [PATCH 1/4] 1. Hashing search and test using go --- codes/go/chapter_searching/hashing_search.go | 35 +++++++++++++++++++ .../chapter_searching/hashing_search_test.go | 35 +++++++++++++++++++ 2 files changed, 70 insertions(+) create mode 100644 codes/go/chapter_searching/hashing_search.go create mode 100644 codes/go/chapter_searching/hashing_search_test.go diff --git a/codes/go/chapter_searching/hashing_search.go b/codes/go/chapter_searching/hashing_search.go new file mode 100644 index 00000000..2920d8e5 --- /dev/null +++ b/codes/go/chapter_searching/hashing_search.go @@ -0,0 +1,35 @@ +// File: binary_search.go +// Created Time: 2022-12-12 +// Author: Slone123c (274325721@qq.com) + +package chapter_searching + +import ( + //"fmt" + "github.com/krahets/hello-algo/pkg" + _ "github.com/krahets/hello-algo/pkg" +) + +/* 哈希查找(数组) */ +func hashingSearch(m map[int]int, target int) int { + // 哈希表的 key: 目标元素,value: 索引 + // 若哈希表中无此 key ,返回 -1 + + if index, ok := m[target]; ok { + return index + } else { + return -1 + } +} + +/* 哈希查找(数组) */ +func hashingSearch1(m map[int]*pkg.ListNode, target int) *pkg.ListNode { + // 哈希表的 key: 目标结点值,value: 结点对象 + // 若哈希表中无此 key ,返回 nil + + if node, ok := m[target]; ok { + return node + } else { + return nil + } +} diff --git a/codes/go/chapter_searching/hashing_search_test.go b/codes/go/chapter_searching/hashing_search_test.go new file mode 100644 index 00000000..2ea67035 --- /dev/null +++ b/codes/go/chapter_searching/hashing_search_test.go @@ -0,0 +1,35 @@ +// File: binary_search.go +// Created Time: 2022-12-12 +// Author: Slone123c (274325721@qq.com) + +package chapter_searching + +import ( + "fmt" + "github.com/krahets/hello-algo/pkg" + "testing" +) + +func TestHashingSearch(t *testing.T) { + target := 3 + /* 哈希查找(数组) */ + nums := []int{1, 5, 3, 2, 4, 7, 5, 9, 10, 8} + // 初始化哈希表 + m := make(map[int]int) + for i := 0; i < len(nums); i++ { + m[nums[i]] = i + } + index := hashingSearch(m, target) + fmt.Println("目标元素 3 的索引 = ", index) + + /* 哈希查找(链表) */ + head := pkg.ArrayToLinkedList(nums) + // 初始化哈希表 + m1 := make(map[int]*pkg.ListNode) + for head != nil { + m1[head.Val] = head + head = head.Next + } + node := hashingSearch1(m1, target) + fmt.Println("目标结点值 3 的对应结点对象为 ", node) +} From c5e5be07b86b7cb337760b1e5f6436dea647f935 Mon Sep 17 00:00:00 2001 From: chenshilong Date: Mon, 12 Dec 2022 16:41:41 +0800 Subject: [PATCH 2/4] 1. Hashing search and test using go --- codes/go/chapter_searching/hashing_search.go | 4 +--- docs/chapter_searching/hashing_search.md | 22 ++++++++++++++++++-- 2 files changed, 21 insertions(+), 5 deletions(-) diff --git a/codes/go/chapter_searching/hashing_search.go b/codes/go/chapter_searching/hashing_search.go index 2920d8e5..30096f1c 100644 --- a/codes/go/chapter_searching/hashing_search.go +++ b/codes/go/chapter_searching/hashing_search.go @@ -14,7 +14,6 @@ import ( func hashingSearch(m map[int]int, target int) int { // 哈希表的 key: 目标元素,value: 索引 // 若哈希表中无此 key ,返回 -1 - if index, ok := m[target]; ok { return index } else { @@ -22,11 +21,10 @@ func hashingSearch(m map[int]int, target int) int { } } -/* 哈希查找(数组) */ +/* 哈希查找(链表) */ func hashingSearch1(m map[int]*pkg.ListNode, target int) *pkg.ListNode { // 哈希表的 key: 目标结点值,value: 结点对象 // 若哈希表中无此 key ,返回 nil - if node, ok := m[target]; ok { return node } else { diff --git a/docs/chapter_searching/hashing_search.md b/docs/chapter_searching/hashing_search.md index d00fc21b..4fb18983 100644 --- a/docs/chapter_searching/hashing_search.md +++ b/docs/chapter_searching/hashing_search.md @@ -53,7 +53,16 @@ comments: true === "Go" ```go title="hashing_search.go" - + /* 哈希查找(数组) */ + func hashingSearch(m map[int]int, target int) int { + // 哈希表的 key: 目标元素,value: 索引 + // 若哈希表中无此 key ,返回 -1 + if index, ok := m[target]; ok { + return index + } else { + return -1 + } + } ``` === "JavaScript" @@ -121,7 +130,16 @@ comments: true === "Go" ```go title="hashing_search.go" - + /* 哈希查找(链表) */ + func hashingSearch1(m map[int]*pkg.ListNode, target int) *pkg.ListNode { + // 哈希表的 key: 目标结点值,value: 结点对象 + // 若哈希表中无此 key ,返回 nil + if node, ok := m[target]; ok { + return node + } else { + return nil + } + } ``` === "JavaScript" From bb24e8083ad637dfc59bad5668289188c6cc4567 Mon Sep 17 00:00:00 2001 From: chenshilong Date: Mon, 12 Dec 2022 23:17:33 +0800 Subject: [PATCH 3/4] 1. Code formatted --- codes/go/chapter_searching/hashing_search.go | 8 ++------ codes/go/chapter_searching/hashing_search_test.go | 6 +++--- 2 files changed, 5 insertions(+), 9 deletions(-) diff --git a/codes/go/chapter_searching/hashing_search.go b/codes/go/chapter_searching/hashing_search.go index 30096f1c..22af449f 100644 --- a/codes/go/chapter_searching/hashing_search.go +++ b/codes/go/chapter_searching/hashing_search.go @@ -4,11 +4,7 @@ package chapter_searching -import ( - //"fmt" - "github.com/krahets/hello-algo/pkg" - _ "github.com/krahets/hello-algo/pkg" -) +import . "github.com/krahets/hello-algo/pkg" /* 哈希查找(数组) */ func hashingSearch(m map[int]int, target int) int { @@ -22,7 +18,7 @@ func hashingSearch(m map[int]int, target int) int { } /* 哈希查找(链表) */ -func hashingSearch1(m map[int]*pkg.ListNode, target int) *pkg.ListNode { +func hashingSearch1(m map[int]*ListNode, target int) *ListNode { // 哈希表的 key: 目标结点值,value: 结点对象 // 若哈希表中无此 key ,返回 nil if node, ok := m[target]; ok { diff --git a/codes/go/chapter_searching/hashing_search_test.go b/codes/go/chapter_searching/hashing_search_test.go index 2ea67035..4bccd038 100644 --- a/codes/go/chapter_searching/hashing_search_test.go +++ b/codes/go/chapter_searching/hashing_search_test.go @@ -6,7 +6,7 @@ package chapter_searching import ( "fmt" - "github.com/krahets/hello-algo/pkg" + . "github.com/krahets/hello-algo/pkg" "testing" ) @@ -23,9 +23,9 @@ func TestHashingSearch(t *testing.T) { fmt.Println("目标元素 3 的索引 = ", index) /* 哈希查找(链表) */ - head := pkg.ArrayToLinkedList(nums) + head := ArrayToLinkedList(nums) // 初始化哈希表 - m1 := make(map[int]*pkg.ListNode) + m1 := make(map[int]*ListNode) for head != nil { m1[head.Val] = head head = head.Next From 92e00a52414a3280fd460de32adbdbc709b97e5c Mon Sep 17 00:00:00 2001 From: chenshilong Date: Mon, 12 Dec 2022 23:24:20 +0800 Subject: [PATCH 4/4] 1. hashing_search.md editted --- docs/chapter_searching/hashing_search.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/docs/chapter_searching/hashing_search.md b/docs/chapter_searching/hashing_search.md index 4fb18983..e1fcb38e 100644 --- a/docs/chapter_searching/hashing_search.md +++ b/docs/chapter_searching/hashing_search.md @@ -131,7 +131,7 @@ comments: true ```go title="hashing_search.go" /* 哈希查找(链表) */ - func hashingSearch1(m map[int]*pkg.ListNode, target int) *pkg.ListNode { + func hashingSearch1(m map[int]*ListNode, target int) *ListNode { // 哈希表的 key: 目标结点值,value: 结点对象 // 若哈希表中无此 key ,返回 nil if node, ok := m[target]; ok {