Files
hello-algo/en/codes/kotlin/chapter_searching/hashing_search.kt
Yudong Jin 2778a6f9c7 Translate all code to English (#1836)
* Review the EN heading format.

* Fix pythontutor headings.

* Fix pythontutor headings.

* bug fixes

* Fix headings in **/summary.md

* Revisit the CN-to-EN translation for Python code using Claude-4.5

* Revisit the CN-to-EN translation for Java code using Claude-4.5

* Revisit the CN-to-EN translation for Cpp code using Claude-4.5.

* Fix the dictionary.

* Fix cpp code translation for the multipart strings.

* Translate Go code to English.

* Update workflows to test EN code.

* Add EN translation for C.

* Add EN translation for CSharp.

* Add EN translation for Swift.

* Trigger the CI check.

* Revert.

* Update en/hash_map.md

* Add the EN version of Dart code.

* Add the EN version of Kotlin code.

* Add missing code files.

* Add the EN version of JavaScript code.

* Add the EN version of TypeScript code.

* Fix the workflows.

* Add the EN version of Ruby code.

* Add the EN version of Rust code.

* Update the CI check for the English version  code.

* Update Python CI check.

* Fix cmakelists for en/C code.

* Fix Ruby comments
2025-12-31 07:44:52 +08:00

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 this key does not exist in the hash table, 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 key is not in 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("Node object corresponding to target node value 3 is $node")
}