/** * 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 buckets; public: ArrayHashMap() { // 初始化陣列,包含 100 個桶 buckets = vector(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 pairSet() { vector pairSet; for (Pair *pair : buckets) { if (pair != nullptr) { pairSet.push_back(pair); } } return pairSet; } /* 獲取所有鍵 */ vector keySet() { vector keySet; for (Pair *pair : buckets) { if (pair != nullptr) { keySet.push_back(pair->key); } } return keySet; } /* 獲取所有值 */ vector valueSet() { vector 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