Method put

java/706_Design_HashMap.java:4–12

(int key, int value)

    final ListNode[] nodes = new ListNode[10000];
    // https://leetcode.com/problems/design-hashmap/discuss/152746/Java-Solution
    public void put(int key, int value) {
        int i = idx(key);
        if (nodes[i] == null)
            nodes[i] = new ListNode(-1, -1);
        ListNode prev = find(nodes[i], key);
        if (prev.next == null)
            prev.next = new ListNode(key, value);
        else prev.next.val = value;
    }

    public int get(int key) {
        int i = idx(key);