Rehashing

原创 2016年05月30日 22:42:01

这道题考查的是coding的熟练程度,我感觉,对于数组和链表的基本操作。

要注意的是对于值为负数的取模处理, if you directly calculate -4 % 3 you will get -1. You can use function: a % b = (a % b + b) % b to make it is a non negative integer.

/**
     * @param hashTable: A list of The first node of linked list
     * @return: A list of The first node of linked list which have twice size
     */    
    public ListNode[] rehashing(ListNode[] hashTable) {
        // write your code here
        if (hashTable == null || hashTable.length == 0) {
            return null;
        }
        int length = hashTable.length*2;
        ListNode[] results = new ListNode [length];
        for (ListNode node: hashTable) {
            if (node != null) {
                while(node != null) {
                    int hashCode = hashcode(node.val, length);
                    if (results[hashCode] == null) {
                        results[hashCode] = new ListNode(node.val);
                    } else {
                        ListNode cur = results[hashCode];
                        while (cur.next != null) {
                            cur = cur.next;
                        }
                        cur.next = new ListNode(node.val);
                    }
                    node = node.next;
                }
            }
        }
        return results;
    }
    
    private int hashcode(int key, int capacity) {
        if (key > 0) {
            return key % capacity;
        } 
        ////2
        else {
            return (key % capacity + capacity) % capacity;
        }
        ////2
    }


#129 Rehashing

题目描述: The size of the hash table is not determinate at the very beginning. If the total size ...

129.Rehashing-重哈希(中等题)

重哈希 题目哈希表容量的大小在一开始是不确定的。如果哈希表存储的元素太多(如超过容量的十分之一),我们应该将哈希表容量扩大一倍,并将所有的哈希值重新安排。假设你有如下一哈希表:size=3, cap...
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:Rehashing
举报原因:
原因补充:

(最多只允许输入30个字)