You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
hello-algo/zh-hant/codes/dart/chapter_searching/hashing_search.dart

55 lines
1.5 KiB

This file contains ambiguous Unicode characters!

This file contains ambiguous Unicode characters that may be confused with others in your current locale. If your use case is intentional and legitimate, you can safely ignore this warning. Use the Escape button to highlight these characters.

/**
* File: hashing_search.dart
* Created Time: 2023-05-12
* Author: Jefferson (JeffersonHuang77@gmail.com)
*/
import 'dart:collection';
import '../utils/list_node.dart';
/* 雜湊查詢(陣列) */
int hashingSearchArray(Map<int, int> map, int target) {
// 雜湊表的 key: 目標元素value: 索引
// 若雜湊表中無此 key ,返回 -1
if (!map.containsKey(target)) {
return -1;
}
return map[target]!;
}
/* 雜湊查詢(鏈結串列) */
ListNode? hashingSearchLinkedList(Map<int, ListNode> map, int target) {
// 雜湊表的 key: 目標節點值value: 節點物件
// 若雜湊表中無此 key ,返回 null
if (!map.containsKey(target)) {
return null;
}
return map[target]!;
}
/* Driver Code */
void main() {
int target = 3;
/* 雜湊查詢(陣列) */
List<int> nums = [1, 5, 3, 2, 4, 7, 5, 9, 10, 8];
// 初始化雜湊表
Map<int, int> map = HashMap();
for (int i = 0; i < nums.length; i++) {
map.putIfAbsent(nums[i], () => i); // key: 元素value: 索引
}
int index = hashingSearchArray(map, target);
print('目標元素 3 的索引 = $index');
/* 雜湊查詢(鏈結串列) */
ListNode? head = listToLinkedList(nums);
// 初始化雜湊表
Map<int, ListNode> map1 = HashMap();
while (head != null) {
map1.putIfAbsent(head.val, () => head!); // key: 節點值value: 節點
head = head.next;
}
ListNode? node = hashingSearchLinkedList(map1, target);
print('目標節點值 3 的對應節點物件為 $node');
}