c++中如何实现链地址法_c++链地址法实现方法

#include 
#include 
#include 
#include 

class HashTable {
private:
    std::vector> buckets;
    int size;

    int hash(int key) {
        return key % size;
    }

public:
    HashTable(int capacity) : size(capacity) {
        buckets.resize(size);
    }

    // 插入元素
    void insert(int key) {
        int index = hash(key);
        auto& chain = buckets[index];
        if (std::find(chain.begin(), chain.end(), key) == chain.end()) {
            chain.push_back(key);
        }
    }

    // 删除元素
    void remove(int key) {
        int index = hash(key);
        auto& chain = buckets[index];
        auto it = std::find(chain.begin(), chain.end(), key);
        if (it != chain.end()) {
            chain.erase(it);
        }
    }

    // 查找元素
    bool search(int key) {
        int index = hash(key);
        auto& chain = buckets[index];
        return std::find(chain.begin(), chain.end(), key) != chain.end();
    }

    // 打印哈希表（用于调试）
    void display() {
        for (int i = 0; i < size; ++i) {
            std::cout << "Bucket " << i << ": ";
            for (int key : buckets[i]) {
                std::cout << key << " -> ";
            }
            std::cout << "null\n";
        }
    }
};

int main() {
    HashTable ht(5);

    ht.insert(12);
    ht.insert(25);
    ht.insert(37);
    ht.insert(22);

    ht.display();

    std::cout << "Search 25: " << (ht.search(25) ? "Found" : "Not Found") << "\n";
    std::cout << "Search 100: " << (ht.search(100) ? "Found" : "Not Found") << "\n";

    ht.remove(25);
    std::cout << "After removing 25, Search 25: " << (ht.search(25) ? "Found" : "Not Found") << "\n";

    return 0;
}