CS_learn/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2026-04-13 17:09:46 +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

15
codes/cpp/chapter_searching/hashing_search.cpp
View File

@@ -16,7 +16,7 @@ int hashingSearchArray(unordered_map<int, int> map, int target) {
}
/* 哈希查找（链表） */
ListNode* hashingSearchLinkedList(unordered_map<int, ListNode*> map, int target) {
ListNode *hashingSearchLinkedList(unordered_map<int, ListNode *> map, int target) {
// 哈希表的 key: 目标节点值，value: 节点对象
// 若哈希表中无此 key ，返回 nullptr
if (map.find(target) == map.end())
@@ -24,30 +24,29 @@ ListNode* hashingSearchLinkedList(unordered_map<int, ListNode*> map, int target)
return map[target];
}
/* Driver Code */
int main() {
int target = 3;
/* 哈希查找（数组） */
vector<int> nums = { 1, 5, 3, 2, 4, 7, 5, 9, 10, 8 };
vector<int> nums = {1, 5, 3, 2, 4, 7, 5, 9, 10, 8};
// 初始化哈希表
unordered_map<int, int> map;
for (int i = 0; i < nums.size(); i++) {
map[nums[i]] = i; // key: 元素，value: 索引
map[nums[i]] = i; // key: 元素，value: 索引
}
int index = hashingSearchArray(map, target);
cout << "目标元素 3 的索引 = " << index << endl;
/* 哈希查找（链表） */
ListNode* head = vecToLinkedList(nums);
ListNode *head = vecToLinkedList(nums);
// 初始化哈希表
unordered_map<int, ListNode*> map1;
unordered_map<int, ListNode *> map1;
while (head != nullptr) {
map1[head->val] = head; // key: 节点值，value: 节点
map1[head->val] = head; // key: 节点值，value: 节点
head = head->next;
}
ListNode* node = hashingSearchLinkedList(map1, target);
ListNode *node = hashingSearchLinkedList(map1, target);
cout << "目标节点值 3 的对应节点对象为 " << node << endl;
return 0;