algorithm/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2025-07-06 14:27:26 +08:00
Code Issues Packages Projects Releases Wiki Activity

Format C++ codes in Clang-Format Style: Microsoft

Browse Source
This commit is contained in:
krahets
2023-04-14 03:44:02 +08:00
parent f8513455b5
commit 9c9c8b7574
46 changed files with 732 additions and 888 deletions
Download Patch File Download Diff File Expand all files Collapse all files

35
codes/cpp/chapter_hashing/array_hash_map.cpp
View File

@ -8,7 +8,7 @@
/* 键值对 int->String */
struct Entry {
public:
public:
int key;
string val;
Entry(int key, string val) {
@ -19,12 +19,13 @@ public:
/* 基于数组简易实现的哈希表 */
class ArrayHashMap {
private:
vector<Entry*> buckets;
public:
private:
vector<Entry *> buckets;
public:
ArrayHashMap() {
// 初始化数组，包含 100 个桶
buckets = vector<Entry*>(100);
buckets = vector<Entry *>(100);
}
/* 哈希函数 */
@ -36,7 +37,7 @@ public:
/* 查询操作 */
string get(int key) {
int index = hashFunc(key);
Entry* pair = buckets[index];
Entry *pair = buckets[index];
if (pair == nullptr)
return nullptr;
return pair->val;
@ -44,7 +45,7 @@ public:
/* 添加操作 */
void put(int key, string val) {
Entry* pair = new Entry(key, val);
Entry *pair = new Entry(key, val);
int index = hashFunc(key);
buckets[index] = pair;
}
@ -57,9 +58,9 @@ public:
}
/* 获取所有键值对 */
vector<Entry*> entrySet() {
vector<Entry*> entrySet;
for (Entry* pair: buckets) {
vector<Entry *> entrySet() {
vector<Entry *> entrySet;
for (Entry *pair : buckets) {
if (pair != nullptr) {
entrySet.push_back(pair);
}
@ -70,7 +71,7 @@ public:
/* 获取所有键 */
vector<int> keySet() {
vector<int> keySet;
for (Entry* pair: buckets) {
for (Entry *pair : buckets) {
if (pair != nullptr) {
keySet.push_back(pair->key);
}
@ -81,8 +82,8 @@ public:
/* 获取所有值 */
vector<string> valueSet() {
vector<string> valueSet;
for (Entry* pair: buckets) {
if (pair != nullptr){
for (Entry *pair : buckets) {
if (pair != nullptr) {
valueSet.push_back(pair->val);
}
}
@ -91,7 +92,7 @@ public:
/* 打印哈希表 */
void print() {
for (Entry* kv: entrySet()) {
for (Entry *kv : entrySet()) {
cout << kv->key << " -> " << kv->val << endl;
}
}
@ -125,17 +126,17 @@ int main() {
/* 遍历哈希表 */
cout << "\n遍历键值对 Key->Value" << endl;
for (auto kv: map.entrySet()) {
for (auto kv : map.entrySet()) {
cout << kv->key << " -> " << kv->val << endl;
}
cout << "\n单独遍历键 Key" << endl;
for (auto key: map.keySet()) {
for (auto key : map.keySet()) {
cout << key << endl;
}
cout << "\n单独遍历值 Value" << endl;
for (auto val: map.valueSet()) {
for (auto val : map.valueSet()) {
cout << val << endl;
}