/**
 * File: hashing_search.cs
 * Created Time: 2022-12-23
 * Author: haptear (haptear@hotmail.com)
 */

namespace hello_algo.chapter_searching;

public class hashing_search {
    /* Hash search (array) */
    int HashingSearchArray(Dictionary<int, int> map, int target) {
        // Hash table's key: target element, value: index
        // If the hash table does not contain this key, return -1
        return map.GetValueOrDefault(target, -1);
    }

    /* Hash search (linked list) */
    ListNode? HashingSearchLinkedList(Dictionary<int, ListNode> map, int target) {

        // Hash table key: target node value, value: node object
        // If the key is not in the hash table, return null
        return map.GetValueOrDefault(target);
    }

    [Test]
    public void Test() {
        int target = 3;

        /* Hash search (array) */
        int[] nums = [1, 5, 3, 2, 4, 7, 5, 9, 10, 8];
        // Initialize hash table
        Dictionary<int, int> map = [];
        for (int i = 0; i < nums.Length; i++) {
            map[nums[i]] = i;  // key: element, value: index
        }
        int index = HashingSearchArray(map, target);
        Console.WriteLine("The index of target element 3 is" + index);

        /* Hash search (linked list) */
        ListNode? head = ListNode.ArrToLinkedList(nums);
        // Initialize hash table
        Dictionary<int, ListNode> map1 = [];
        while (head != null) {
            map1[head.val] = head;  // key: node value, value: node
            head = head.next;
        }
        ListNode? node = HashingSearchLinkedList(map1, target);
        Console.WriteLine("The corresponding node object for target node value 3 is" + node);
    }
}