如何添加與表的每個哈希地址相對應的計數器？

Question

我正在使用鏈表創建哈希表，表工作正常，但是我需要為表中的每個地址創建一個計數器。

程序必須跟蹤表中每個地址的當前沖突計數。 為此，每個地址必須有一個計數器。 地址為0 .. tableSize-1。 每次程序插入一個元素時，它都必須遞增與該元素的哈希地址相對應的計數器。 同樣，每當從表中刪除元素時，與該元素的哈希地址相對應的計數器都必須遞減。

我將如何去做呢？ 我是否應該在列表或哈希表中添加變量以保持跟蹤。我不想包含太多代碼，以免使事情變得混亂，因此我將包含來自LinkedList.cpp和Hashtable.cpp的片段。

哈希表

#include "HashTable.h"

// Constructs the empty Hash Table object.
// Array length is set to 13 by default.
HashTable::HashTable( int tableLength )
{
if (tableLength <= 0) tableLength = 13;
array = new LinkedList[ tableLength ];
length = tableLength;
}

// Returns an array location for a given item key.
int HashTable::hash( string itemKey )
{
int hashAddress=0;


for ( int i = 0; i < itemKey.length(); i++ )
   hashAddress= atoi(itemKey.c_str());
return (hashAddress  ) % length;
}

// Adds an item to the Hash Table.
void HashTable::insertItem( Item * newItem )
{
int index = hash( newItem -> key );
array[ index ].insertItem( newItem );
}

// Deletes an Item by key from the Hash Table.
// Returns true if the operation is successful.
bool HashTable::removeItem( string itemKey )
{
int index = hash( itemKey );
return array[ index ].removeItem( itemKey );
}

// Returns an item from the Hash Table by key.
// If the item isn't found, a null pointer is returned.
Item * HashTable::getItemByKey( string itemKey )
{

。 。 。

鏈接列表

#include "LinkedList.h"

// Constructs the empty linked list object.
// Creates the head node and sets length to zero.
LinkedList::LinkedList()
  {
   head = new Item;
   head -> next = NULL;
   length = 0;
}

// Inserts an item at the end of the list.
void LinkedList::insertItem( Item * newItem )
{
if (!head -> next)
{
    head -> next = newItem;
    length++;
    return;
}
Item * p = head;
Item * q = head;
while (q)
{
    p = q;
    q = p -> next;
}
p -> next = newItem;
newItem -> next = NULL;
length++;
}

// Removes an item from the list by item key.
// Returns true if the operation is successful.
bool LinkedList::removeItem( string itemKey )
{
if (!head -> next) return false;
Item * p = head;
Item * q = head;
while (q)
{
    if (q -> key == itemKey)
    {
        p -> next = q -> next;
        delete q;
        length--;
        return true;
    }
    p = q;
    q = p -> next;
}
return false;
}

// Searches for an item by its key.
// Returns a reference to first match.
// Returns a NULL pointer if no match is found.
Item * LinkedList::getItem( string itemKey )

。 。 。

Answer 1

嘗試這個：

class HashTable {
    private:
        std::vector<int>* m_collisionsTracker = nullptr;
        ...
}

HashTable::HashTable(int tableLength) {
    ...
    m_collisionsTracker = new std::vector<int>(length);
    std::fill(m_collisionsTracker.begin(), m_collisionsTracker.end(), 0);
}

HashTable::~HashTable() {
    ...
    delete m_collisionsTracker;
}

void HashTable::insertItem(Item * newItem) {
    int index = hash(newItem->key);
    array[index].insertItem(newItem);
    m_collisionsTracker[index] += 1; // If I right understand it's what you need.
}

...

void LinkedList::insertItem(Item* newItem) {
    Item* p = head;
    while (p->next) {
        p = p->next;
    }
    p->next = newItem;
    newItem->next = nullptr;
    length++;
}