Add C++, Python, Go code for chapter_hashing

This commit is contained in:
machangxin
2022-12-14 17:18:32 +08:00
parent e5e6553f82
commit aeb4e6077d
10 changed files with 792 additions and 8 deletions

View File

@@ -0,0 +1,96 @@
// File: array_hash_map.go
// Created Time: 2022-12-14
// Author: msk397 (machangxinq@gmail.com)
package chapter_hashing
import "fmt"
// 键值对 int->String
type Entry struct {
key int
val string
}
// 基于数组简易实现的哈希表
type ArrayHashMap struct {
bucket []Entry
}
func newArrayHashMap() *ArrayHashMap {
// 初始化一个长度为 100 的桶(数组)
bucket := make([]Entry, 100)
return &ArrayHashMap{bucket: bucket}
}
// 哈希函数
func (a *ArrayHashMap) hashFunc(key int) int {
index := key % 100
return index
}
// 查询操作
func (a *ArrayHashMap) get(key int) string {
index := a.hashFunc(key)
pair := a.bucket[index]
if pair.key == 0 {
return ""
}
return pair.val
}
// 添加操作
func (a *ArrayHashMap) put(key int, val string) {
pair := Entry{key: key, val: val}
index := a.hashFunc(key)
a.bucket[index] = pair
}
// 删除操作
func (a *ArrayHashMap) remove(key int) {
index := a.hashFunc(key)
// 置为空字符,代表删除
a.bucket[index] = Entry{}
}
// 获取所有键对
func (a *ArrayHashMap) entrySet() []Entry {
var pairs []Entry
for _, pair := range a.bucket {
if pair.key != 0 {
pairs = append(pairs, pair)
}
}
return pairs
}
// 获取所有键
func (a *ArrayHashMap) keySet() []int {
var keys []int
for _, pair := range a.bucket {
if pair.key != 0 {
keys = append(keys, pair.key)
}
}
return keys
}
// 获取所有值
func (a *ArrayHashMap) valueSet() []string {
var values []string
for _, pair := range a.bucket {
if pair.key != 0 {
values = append(values, pair.val)
}
}
return values
}
// 打印哈希表
func (a *ArrayHashMap) print() {
for _, pair := range a.bucket {
if pair.key != 0 {
fmt.Println(pair.key, "->", pair.val)
}
}
}

View File

@@ -0,0 +1,52 @@
// File: array_hash_map_test.go
// Created Time: 2022-12-14
// Author: msk397 (machangxinq@gmail.com)
package chapter_hashing
import (
"fmt"
"testing"
)
func TestArrayHashMap(t *testing.T) {
/* 初始化哈希表 */
map1 := newArrayHashMap()
/* 添加操作 */
// 在哈希表中添加键值对 (key, value)
map1.put(12836, "小哈")
map1.put(15937, "小啰")
map1.put(16750, "小算")
map1.put(13276, "小法")
map1.put(10583, "小鸭")
fmt.Println("\n添加完成后哈希表为\nKey -> Value")
map1.print()
/* 查询操作 */
// 向哈希表输入键 key ,得到值 value
name := map1.get(15937)
fmt.Println("\n输入学号 15937 ,查询到姓名 " + name)
/* 删除操作 */
// 在哈希表中删除键值对 (key, value)
map1.remove(10583)
fmt.Println("\n删除 10583 后,哈希表为\nKey -> Value")
map1.print()
/* 遍历哈希表 */
fmt.Println("\n遍历键值对 Key->Value")
for _, kv := range map1.entrySet() {
fmt.Println(kv.key, " -> ", kv.val)
}
fmt.Println("\n单独遍历键 Key")
for _, key := range map1.keySet() {
fmt.Println(key)
}
fmt.Println("\n单独遍历值 Value")
for _, val := range map1.valueSet() {
fmt.Println(val)
}
}

View File

@@ -0,0 +1,57 @@
// File: hash_map_test.go
// Created Time: 2022-12-14
// Author: msk397 (machangxinq@gmail.com)
package chapter_hashing
import (
"fmt"
"testing"
)
func TestHashmap(t *testing.T) {
// 初始化哈希表
Map := make(map[int]string)
// 添加操作
// 在哈希表中添加键值对 (key, value)
Map[12836] = "小哈"
Map[15937] = "小啰"
Map[16750] = "小算"
Map[13276] = "小法"
Map[10583] = "小鸭"
fmt.Println("\n添加完成后哈希表为\nKey -> Value")
for key, value := range Map {
fmt.Printf("%d -> %s\n", key, value)
}
// 查询操作
// 向哈希表输入键 key ,得到值 value
name := Map[15937]
fmt.Println("\n输入学号 15937 ,查询到姓名 ", name)
// 删除操作
// 在哈希表中删除键值对 (key, value)
delete(Map, 10583)
fmt.Println("\n删除 10583 后,哈希表为\nKey -> Value")
for key, value := range Map {
fmt.Printf("%d -> %s\n", key, value)
}
/* 遍历哈希表 */
// 遍历键值对 key->value
fmt.Println("\n遍历键值对 Key->Value")
for key, value := range Map {
fmt.Println(key, "->", value)
}
// 单独遍历键 key
fmt.Println("\n单独遍历键 Key")
for key := range Map {
fmt.Println(key)
}
// 单独遍历值 value
fmt.Println("\n单独遍历值 Value")
for _, value := range Map {
fmt.Println(value)
}
}