We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
在 hash_map_open_addressing.cpp 中: /* 添加操作 */void put(int key, string val) 该操作似乎无法实现“开放寻址(线性探测)”的功能。 该功能是:插入元素:通过哈希函数计算桶索引,若发现桶内已有元素,则从冲突位置向后线性遍历,直至找到空桶,将元素插入其中。 但这里的put()函数:int index = findBucket(key);// 若找到键值对,则覆盖 val 并返回
The text was updated successfully, but these errors were encountered:
No branches or pull requests
在 hash_map_open_addressing.cpp 中:
/* 添加操作 */void put(int key, string val)
该操作似乎无法实现“开放寻址(线性探测)”的功能。
该功能是:插入元素:通过哈希函数计算桶索引,若发现桶内已有元素,则从冲突位置向后线性遍历,直至找到空桶,将元素插入其中。
但这里的put()函数:int index = findBucket(key);// 若找到键值对,则覆盖 val 并返回
The text was updated successfully, but these errors were encountered: