哈希表的简单实现

class ListNode
{
public:
	int val;
	ListNode* next;
	ListNode(int x) :val(x), next(NULL) {}
	
};
//开始定义一些数据结构
const int LEN = 11;
//ListNode* haxibiao[] = {0};//指针数组,初始化为NULL

int hash_function(int val)
{
	return val%LEN;
}

void insert_val(ListNode* hashtable[], ListNode* node, int len)
{
	//插入元素
	int charu = hash_function(node->val);
	node->next = hashtable[charu];
	hashtable[charu] = node;
}
bool find_val(ListNode* hashtable[], ListNode* node, int len)
{
	int charu = hash_function(node->val);
	auto charuhasttable = hashtable[charu];
	while (charuhasttable != NULL)
	{
		if (charuhasttable->val == node->val)
			return true;
		charuhasttable = charuhasttable->next;
	}
	return false;
}