mirror of
https://github.com/krahets/hello-algo.git
synced 2024-12-26 11:46:29 +08:00
e720aa2d24
* Sync recent changes to the revised Word. * Revised the preface chapter * Revised the introduction chapter * Revised the computation complexity chapter * Revised the chapter data structure * Revised the chapter array and linked list * Revised the chapter stack and queue * Revised the chapter hashing * Revised the chapter tree * Revised the chapter heap * Revised the chapter graph * Revised the chapter searching * Reivised the sorting chapter * Revised the divide and conquer chapter * Revised the chapter backtacking * Revised the DP chapter * Revised the greedy chapter * Revised the appendix chapter * Revised the preface chapter doubly * Revised the figures
110 lines
2.3 KiB
C++
110 lines
2.3 KiB
C++
/**
|
|
* File: array_hash_map.cpp
|
|
* Created Time: 2022-12-14
|
|
* Author: msk397 (machangxinq@gmail.com)
|
|
*/
|
|
|
|
#include "../utils/common.hpp"
|
|
|
|
/* 键值对 */
|
|
struct Pair {
|
|
public:
|
|
int key;
|
|
string val;
|
|
Pair(int key, string val) {
|
|
this->key = key;
|
|
this->val = val;
|
|
}
|
|
};
|
|
|
|
/* 基于数组实现的哈希表 */
|
|
class ArrayHashMap {
|
|
private:
|
|
vector<Pair *> buckets;
|
|
|
|
public:
|
|
ArrayHashMap() {
|
|
// 初始化数组,包含 100 个桶
|
|
buckets = vector<Pair *>(100);
|
|
}
|
|
|
|
~ArrayHashMap() {
|
|
// 释放内存
|
|
for (const auto &bucket : buckets) {
|
|
delete bucket;
|
|
}
|
|
buckets.clear();
|
|
}
|
|
|
|
/* 哈希函数 */
|
|
int hashFunc(int key) {
|
|
int index = key % 100;
|
|
return index;
|
|
}
|
|
|
|
/* 查询操作 */
|
|
string get(int key) {
|
|
int index = hashFunc(key);
|
|
Pair *pair = buckets[index];
|
|
if (pair == nullptr)
|
|
return "";
|
|
return pair->val;
|
|
}
|
|
|
|
/* 添加操作 */
|
|
void put(int key, string val) {
|
|
Pair *pair = new Pair(key, val);
|
|
int index = hashFunc(key);
|
|
buckets[index] = pair;
|
|
}
|
|
|
|
/* 删除操作 */
|
|
void remove(int key) {
|
|
int index = hashFunc(key);
|
|
// 释放内存并置为 nullptr
|
|
delete buckets[index];
|
|
buckets[index] = nullptr;
|
|
}
|
|
|
|
/* 获取所有键值对 */
|
|
vector<Pair *> pairSet() {
|
|
vector<Pair *> pairSet;
|
|
for (Pair *pair : buckets) {
|
|
if (pair != nullptr) {
|
|
pairSet.push_back(pair);
|
|
}
|
|
}
|
|
return pairSet;
|
|
}
|
|
|
|
/* 获取所有键 */
|
|
vector<int> keySet() {
|
|
vector<int> keySet;
|
|
for (Pair *pair : buckets) {
|
|
if (pair != nullptr) {
|
|
keySet.push_back(pair->key);
|
|
}
|
|
}
|
|
return keySet;
|
|
}
|
|
|
|
/* 获取所有值 */
|
|
vector<string> valueSet() {
|
|
vector<string> valueSet;
|
|
for (Pair *pair : buckets) {
|
|
if (pair != nullptr) {
|
|
valueSet.push_back(pair->val);
|
|
}
|
|
}
|
|
return valueSet;
|
|
}
|
|
|
|
/* 打印哈希表 */
|
|
void print() {
|
|
for (Pair *kv : pairSet()) {
|
|
cout << kv->key << " -> " << kv->val << endl;
|
|
}
|
|
}
|
|
};
|
|
|
|
// 测试样例请见 array_hash_map_test.cpp
|