C++ Hash Table Implementation Guide

In C++, a hash table can be implemented using std::unordered_map. unordered_map is a type of associative container provided in the C++ standard library, which is implemented based on a hash table and allows for efficient lookup, insertion, and deletion operations. Here is a simple example:

#include <iostream>
#include <unordered_map>

int main() {
    std::unordered_map<int, std::string> myMap;

    // 插入数据
    myMap[1] = "One";
    myMap[2] = "Two";
    myMap[3] = "Three";

    // 查找数据
    std::cout << "Value at key 2: " << myMap[2] << std::endl;

    // 删除数据
    myMap.erase(1);

    // 遍历哈希表
    for (const auto& pair : myMap) {
        std::cout << "Key: " << pair.first << ", Value: " << pair.second << std::endl;
    }

    return 0;
}

In the example above, we utilized std::unordered_map to create a hash table, then inserted some data, looked up data, removed data, and traversed the entire hash table. It can be seen that using std::unordered_map makes it convenient to implement the functionality of a hash table.