algorithm/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2025-11-02 12:58:42 +08:00
Code Issues Packages Projects Releases Wiki Activity

Bug fixes to C code.

Browse Source
This commit is contained in:
krahets
2023-11-01 05:14:22 +08:00
parent f7dd05e7a4
commit 355cc3a6b1
31 changed files with 246 additions and 219 deletions
Download Patch File Download Diff File Expand all files Collapse all files

119
codes/c/chapter_hashing/array_hash_map.c
View File

@ -7,7 +7,7 @@
#include "../utils/common.h"
/* 哈希表默认大小 */
#define HASH_MAP_DEFAULT_SIZE 100
#define HASHTABLE_CAPACITY 100
/* 键值对 int->string */
typedef struct {
@ -23,131 +23,133 @@ typedef struct {
/* 基于数组简易实现的哈希表 */
typedef struct {
Pair *buckets[HASH_MAP_DEFAULT_SIZE];
Pair *buckets[HASHTABLE_CAPACITY];
} ArrayHashMap;
/* 哈希表初始化函数 */
/* 构造函数 */
ArrayHashMap *newArrayHashMap() {
ArrayHashMap *map = malloc(sizeof(ArrayHashMap));
return map;
ArrayHashMap *hmap = malloc(sizeof(ArrayHashMap));
return hmap;
}
/* 析构函数 */
void delArrayHashMap(ArrayHashMap *hmap) {
for (int i = 0; i < HASHTABLE_CAPACITY; i++) {
if (hmap->buckets[i] != NULL) {
free(hmap->buckets[i]->val);
free(hmap->buckets[i]);
}
}
free(hmap);
}
/* 哈希函数 */
int hashFunc(int key) {
int index = key % HASH_MAP_DEFAULT_SIZE;
int index = key % HASHTABLE_CAPACITY;
return index;
}
/* 查询操作 */
const char *get(const ArrayHashMap *d, const int key) {
const char *get(const ArrayHashMap *hmap, const int key) {
int index = hashFunc(key);
const Pair *Pair = d->buckets[index];
const Pair *Pair = hmap->buckets[index];
if (Pair == NULL)
return NULL;
return Pair->val;
}
/* 添加操作 */
void put(ArrayHashMap *d, const int key, const char *val) {
void put(ArrayHashMap *hmap, const int key, const char *val) {
Pair *Pair = malloc(sizeof(Pair));
Pair->key = key;
Pair->val = malloc(strlen(val) + 1);
strcpy(Pair->val, val);
int index = hashFunc(key);
d->buckets[index] = Pair;
hmap->buckets[index] = Pair;
}
/* 删除操作 */
void removeItem(ArrayHashMap *d, const int key) {
void removeItem(ArrayHashMap *hmap, const int key) {
int index = hashFunc(key);
free(d->buckets[index]->val);
free(d->buckets[index]);
d->buckets[index] = NULL;
free(hmap->buckets[index]->val);
free(hmap->buckets[index]);
hmap->buckets[index] = NULL;
}
/* 获取所有键值对 */
void pairSet(ArrayHashMap *d, MapSet *set) {
void pairSet(ArrayHashMap *hmap, MapSet *set) {
Pair *entries;
int i = 0, index = 0;
int total = 0;
/* 统计有效键值对数量 */
for (i = 0; i < HASH_MAP_DEFAULT_SIZE; i++) {
if (d->buckets[i] != NULL) {
for (i = 0; i < HASHTABLE_CAPACITY; i++) {
if (hmap->buckets[i] != NULL) {
total++;
}
}
entries = malloc(sizeof(Pair) * total);
for (i = 0; i < HASH_MAP_DEFAULT_SIZE; i++) {
if (d->buckets[i] != NULL) {
entries[index].key = d->buckets[i]->key;
entries[index].val = malloc(strlen(d->buckets[i]->val + 1));
strcpy(entries[index].val, d->buckets[i]->val);
for (i = 0; i < HASHTABLE_CAPACITY; i++) {
if (hmap->buckets[i] != NULL) {
entries[index].key = hmap->buckets[i]->key;
entries[index].val = malloc(strlen(hmap->buckets[i]->val + 1));
strcpy(entries[index].val, hmap->buckets[i]->val);
index++;
}
}
set->set = entries;
set->len = total;
}
/* 获取所有键 */
void keySet(ArrayHashMap *d, MapSet *set) {
void keySet(ArrayHashMap *hmap, MapSet *set) {
int *keys;
int i = 0, index = 0;
int total = 0;
/* 统计有效键值对数量 */
for (i = 0; i < HASH_MAP_DEFAULT_SIZE; i++) {
if (d->buckets[i] != NULL) {
for (i = 0; i < HASHTABLE_CAPACITY; i++) {
if (hmap->buckets[i] != NULL) {
total++;
}
}
keys = malloc(total * sizeof(int));
for (i = 0; i < HASH_MAP_DEFAULT_SIZE; i++) {
if (d->buckets[i] != NULL) {
keys[index] = d->buckets[i]->key;
for (i = 0; i < HASHTABLE_CAPACITY; i++) {
if (hmap->buckets[i] != NULL) {
keys[index] = hmap->buckets[i]->key;
index++;
}
}
set->set = keys;
set->len = total;
}
/* 获取所有值 */
void valueSet(ArrayHashMap *d, MapSet *set) {
void valueSet(ArrayHashMap *hmap, MapSet *set) {
char **vals;
int i = 0, index = 0;
int total = 0;
/* 统计有效键值对数量 */
for (i = 0; i < HASH_MAP_DEFAULT_SIZE; i++) {
if (d->buckets[i] != NULL) {
for (i = 0; i < HASHTABLE_CAPACITY; i++) {
if (hmap->buckets[i] != NULL) {
total++;
}
}
vals = malloc(total * sizeof(char *));
for (i = 0; i < HASH_MAP_DEFAULT_SIZE; i++) {
if (d->buckets[i] != NULL) {
vals[index] = d->buckets[i]->val;
for (i = 0; i < HASHTABLE_CAPACITY; i++) {
if (hmap->buckets[i] != NULL) {
vals[index] = hmap->buckets[i]->val;
index++;
}
}
set->set = vals;
set->len = total;
}
/* 打印哈希表 */
void print(ArrayHashMap *d) {
void print(ArrayHashMap *hmap) {
int i;
MapSet set;
pairSet(d, &set);
pairSet(hmap, &set);
Pair *entries = (Pair *)set.set;
for (i = 0; i < set.len; i++) {
printf("%d -> %s\n", entries[i].key, entries[i].val);
@ -158,38 +160,38 @@ void print(ArrayHashMap *d) {
/* Driver Code */
int main() {
/* 初始化哈希表 */
ArrayHashMap *map = newArrayHashMap();
ArrayHashMap *hmap = newArrayHashMap();
/* 添加操作 */
// 在哈希表中添加键值对 (key, value)
put(map, 12836, "小哈");
put(map, 15937, "小啰");
put(map, 16750, "小算");
put(map, 13276, "小法");
put(map, 10583, "小鸭");
put(hmap, 12836, "小哈");
put(hmap, 15937, "小啰");
put(hmap, 16750, "小算");
put(hmap, 13276, "小法");
put(hmap, 10583, "小鸭");
printf("\n添加完成后，哈希表为\nKey -> Value\n");
print(map);
print(hmap);
/* 查询操作 */
// 向哈希表输入键 key ，得到值 value
const char *name = get(map, 15937);
const char *name = get(hmap, 15937);
printf("\n输入学号 15937 ，查询到姓名 %s\n", name);
/* 删除操作 */
// 在哈希表中删除键值对 (key, value)
removeItem(map, 10583);
removeItem(hmap, 10583);
printf("\n删除 10583 后，哈希表为\nKey -> Value\n");
print(map);
print(hmap);
/* 遍历哈希表 */
int i;
printf("\n遍历键值对 Key->Value\n");
print(map);
print(hmap);
MapSet set;
keySet(map, &set);
keySet(hmap, &set);
int *keys = (int *)set.set;
printf("\n单独遍历键 Key\n");
for (i = 0; i < set.len; i++) {
@ -197,7 +199,7 @@ int main() {
}
free(set.set);
valueSet(map, &set);
valueSet(hmap, &set);
char **vals = (char **)set.set;
printf("\n单独遍历键 Value\n");
for (i = 0; i < set.len; i++) {
@ -205,5 +207,6 @@ int main() {
}
free(set.set);
delArrayHashMap(hmap);
return 0;
}