/
githubmirror
/
hello-algo
Обзор
Документация
Войти
/
githubmirror
/
hello-algo
Код
Запросы
0
Пакеты
0
Релизы
0
Аналитика
Безопасность
main
en/codes/cpp/chapter_searching/hashing_search.cpp
53 строки
2 KB
Yudong Jin
Translate all code to English (#1836)
31 дек 2025, 02:44
Не верифицирован
31 дек 2025, 02:44
2778a6f
Код
Авторство
О чём код?
/** * File: hashing_search.cpp * Created Time: 2022-11-25 * Author: krahets (krahets@163.com) */ #include "../utils/common.hpp" /* Hash search (array) */ int hashingSearchArray(unordered_map<int, int> map, int target) { // Hash table's key: target element, value: index // If this key does not exist in the hash table, return -1 if (map.find(target) == map.end()) return -1; return map[target]; } /* Hash search (linked list) */ ListNode *hashingSearchLinkedList(unordered_map<int, ListNode *> map, int target) { // Hash table key: target node value, value: node object // Return nullptr if key does not exist in hash table if (map.find(target) == map.end()) return nullptr; return map[target]; } /* Driver Code */ int main() { int target = 3; /* Hash search (array) */ vector<int> nums = {1, 5, 3, 2, 4, 7, 5, 9, 10, 8}; // Initialize hash table unordered_map<int, int> map; for (int i = 0; i < nums.size(); i++) { map[nums[i]] = i; // key: element, value: index } int index = hashingSearchArray(map, target); cout << "Index of target element 3 = " << index << endl; /* Hash search (linked list) */ ListNode *head = vecToLinkedList(nums); // Initialize hash table unordered_map<int, ListNode *> map1; while (head != nullptr) { map1[head->val] = head; // key: node value, value: node head = head->next; } ListNode *node = hashingSearchLinkedList(map1, target); cout << "Node object corresponding to target node value 3 is " << node << endl; return 0; }