完善版本散列表

#include <iostream>
#include <vector>
#include <string>
#include<random>
using namespace std;

template<class T=long long>class factory {
public:
    
    T num;
    factory(T data):num(data){}
    size_t f(long long) { return (num>>32)+static_cast<int>(num); }
    size_t f(char) { return static_cast<size_t>(num); }
    size_t f(string s) {
        random_device t;
        size_t sz = 0;
        for (size_t i = 0; i < s.size(); ++i)
        {
            sz +=static_cast<size_t>(s[i])*static_cast<size_t>(s[i]);
        }
        return sz;
    }
};

template<typename T = int>class Hash {
public:

    Hash() = delete;

    Hash(size_t scale, size_t a, size_t b, vector<T>vec) :scale(scale), a(a), b(b), vec(vec) { size = 0; }



    void insert(T data);

    void remove(T data);

    auto find(T data);

    vector<T>vec;

    void resize();

private:
    size_t  scale;//规模

    int a, b;//除余法;

    size_t size;

    double factor;
};

template<typename T> void Hash<T>::insert(T data) {

    vec[find(data)] = data;
    size++;
    if ((factor = static_cast<decltype(factor)>(size) / scale) > 0.6)
        resize();

}

template<class T>void Hash<T>::resize() {
    vector<T>tmp = vec;
    vec = vector<T>(2 * scale, 0);
    auto t = scale;
    scale *= 2;
    for (size_t i = 0; i < t; ++i)
    {
        if (tmp[i] != 0 && tmp[i] != INT_MIN)
            vec[find(tmp[i])] = tmp[i];
    }

}

template<typename T> void Hash<T>::remove(T data) {
    auto get = factory<T>(data).f(data);
    auto key = (a * get + b) % scale;
    decltype(this->scale)i = 0;
    if (vec[key] == data)
        vec[key] = INT_MIN;
    else {
        while (vec[key] != data && i < scale)
        {
            i++;
            key++;
            if (key == scale)
                key = 0;
        }
        if (i == scale) {
            cout << "can't find your data:  " << data << endl;
            return;
        }
        vec[key] = INT_MIN;
    }
    size--;

}

template<typename T> auto Hash<T>::find(T data) {
    auto get = factory<T>(data).f(data);
    auto key = (a *get + b) % scale;
    if (!vec[key] || vec[key] == INT_MIN)
        return key;
    else
    {
        while (vec[key] != INT_MIN && vec[key] != 0)
        {
            key++;
            if (key == scale)
                key = 0;
        }
        return key;
    }


}

template<>class Hash<string> {
public:
    using T = string;
    Hash() = delete;

    Hash(size_t scale, size_t a, size_t b, vector<T>vec) :scale(scale), a(a), b(b), vec(vec) { size = 0; }

    auto find(T data) {
        auto get = factory<T>(data).f(data);
        auto key = (a * get + b) % scale;
        if (vec[key] == "0" || vec[key] == "deleted")
            return key;
        else
        {
            while (vec[key] != "0" && vec[key] != "deleted")
            {
                key++;
                if (key == scale)
                    key = 0;
            }
            return key;
        }
    }

    void insert(T data) {
        vec[find(data)] = data;
        size++;
        if ((factor = static_cast<decltype(factor)>(size) / scale) > 0.6)
            resize();
    }

    void remove(T data){
        auto get = factory<T>(data).f(data);
        auto key = (a * get + b) % scale;
        decltype(this->scale)i = 0;
        if (vec[key] == data)
            vec[key] = "deleted";
        else {
            while (vec[key] != data && i < scale)
            {
                i++;
                key++;
                if (key == scale)
                    key = 0;
            }
            if (i == scale) {
                cout << "can't find your data:  " << data << endl;
                return;
            }
            vec[key] = "deleted";
        }
        size--;
    }

    vector<T>vec;

    void resize() {
        vector<T>tmp = vec;
        vec = vector<T>(2 * scale, "0");
        auto t = scale;
        scale *= 2;
        for (size_t i = 0; i < t; ++i)
        {
            if (tmp[i] != "0" && tmp[i] != "deleted")
                vec[find(tmp[i])] = tmp[i];
        }
    }

private:
    size_t  scale;//规模

    int a, b;//除余法;

    size_t size;

    double factor;
};

int main()
{
    int a, b, M;
    cout << "a" << endl;
    cin >> a;
    cout << "b" << endl;
    cin >> b;
    cout << "M" << endl;
    cin >> M;

    vector<string>vec(M, "0");
    Hash<string>hash(M, a, b, move(vec));
    /*hash.insert(2011);
    hash.insert(2012);
    hash.insert(2013);
    hash.insert(2014);
    hash.insert(2015);
    hash.insert(2016);
    hash.insert(2017);
    hash.insert(3456);
    hash.insert(4000);*/
    hash.insert("11jj0");
    hash.insert("wocao12");
    hash.insert("wocao");
    hash.insert("wocao");
    for (auto i : hash.vec)
        cout << i << ends;
    cout << endl;
    hash.remove("11jj0");
    for (auto i : hash.vec)
        cout << i << ends;
    cout << endl;
    hash.insert("11jj0");
    for (auto i : hash.vec)
        cout << i << ends;
    cout << endl;
    /*hash.insert(19);
    hash.insert(3);
    for (auto i : hash.vec)
        cout << i << ends;
    cout << endl;
    hash.remove(2);
    hash.remove(1);*/
    /*hash.remove(2011);
    hash.remove(2079);*/
    /*for (auto i : hash.vec)
        cout << i << ends;
    cout << endl;*/
    /*hash.remove(2082);
    for (auto i : hash.vec)
        cout << i << ends;
    cout << endl;
    hash.insert(2069);
    for (auto i : hash.vec)
        cout << i << ends;*/

}

 

还有两个月n2没时间，しかたない 趁着有着半点时间写了点数据结构