c++hash实现(+ELF算法)

Simple_Hash:

#pragma once
class Simple_Hash
{
   
	int* data;
	int count;
	int capacity=10000;
public:
	Simple_Hash()
	{
   
		data = new int[capacity]();
		count = 0;
	}

	void insert(int key, int val)
	{
   
		data[key] = val;
		count++;
	}

	void remove(int key)
	{
   
		data[key] = 0;
		count--;
	}

	int search(int key)
	{
   
		return data[key];
	}

	~Simple_Hash()
	{
   
		delete[] data;
	}
};

Hash:

#pragma once
#include <iostream>
class Hash
{
   
	int* data;
	int count;
	int length;
public:
	Hash(int length) :length(length)
	{
   
		data = new int[length]();
		count = 0;
	}
	~Hash()
	{
   
		delete[] data;
	}
	//插入
	bool insert(int key)
	{
   
		if (full())
		{
   
			return false;
		}
		int base = key % length;	//插入位置
		int step=0;	//偏移位置

		int i = base;
		while (data[i] != 0)
		{
   
			if (data[i] == key)	//相等，则插入重复
			{
   
				return false;
			}
			step++;
			i = (base + step) % length;	//循环判断i值
		}
		data[i] = key;	//赋值
		count++;
		return true;
	}
	//判断是否未满
	bool full()
	{
   
		//容器留一个空位
		return count >= length - 1;
	}
	//返回大小
	int size()
	{
   
		return count;
	}
	//判断是否为空
	bool empty()
	{
   
		return count == 0;
	}
	//搜索
	int search(int key)
	{
   
		int base = key % length;
		int step = 0;
		int i = base;
		while (true)
		{
   
			if