49 lines
1.4 KiB
Kotlin
49 lines
1.4 KiB
Kotlin
/**
|
|
* File: hashing_search.kt
|
|
* Created Time: 2024-01-25
|
|
* Author: curtishd (1023632660@qq.com)
|
|
*/
|
|
|
|
package chapter_searching
|
|
|
|
import utils.ListNode
|
|
|
|
/* Hash search (array) */
|
|
fun hashingSearchArray(map: Map<Int?, Int>, target: Int): Int {
|
|
// Hash table key: Target element, _val: Index
|
|
// If the hash table does not contain this key, return -1
|
|
return map.getOrDefault(target, -1)
|
|
}
|
|
|
|
/* Hash search (linked list) */
|
|
fun hashingSearchLinkedList(map: Map<Int?, ListNode?>, target: Int): ListNode? {
|
|
// Hash table key: Target node value, _val: Node object
|
|
// If the key is not in the hash table, return null
|
|
return map.getOrDefault(target, null)
|
|
}
|
|
|
|
/* Driver Code */
|
|
fun main() {
|
|
val target = 3
|
|
|
|
/* Hash search (array) */
|
|
val nums = intArrayOf(1, 5, 3, 2, 4, 7, 5, 9, 10, 8)
|
|
// Initialize hash table
|
|
val map = HashMap<Int?, Int>()
|
|
for (i in nums.indices) {
|
|
map[nums[i]] = i // key: Element, _val: Index
|
|
}
|
|
val index = hashingSearchArray(map, target)
|
|
println("Index of target element 3 = $index")
|
|
|
|
/* Hash search (linked list) */
|
|
var head = ListNode.arrToLinkedList(nums)
|
|
// Initialize hash table
|
|
val map1 = HashMap<Int?, ListNode?>()
|
|
while (head != null) {
|
|
map1[head._val] = head // key: Node value, _val: Node
|
|
head = head.next
|
|
}
|
|
val node = hashingSearchLinkedList(map1, target)
|
|
println("Corresponding node object for target node value 3 = $node")
|
|
} |