在线美图秀秀在线制作_兰州今天发生的重大新闻_网络营销软件商城_重庆百度快照优化排名

C++哈希计数器，代码见下：

#include<iostream>using namespace std;template<typename KeyType, typename ValueType>
class HashNode {
public:KeyType key;ValueType value;HashNode* next;HashNode(const KeyType& key, const ValueType& value) {this->key = key;this->value = value;this->next = NULL;}
};template<typename KeyType, typename ValueType>
class HashTable {
private:int size;HashNode<KeyType, ValueType>** table;int hash(const KeyType& key) const {int hashkey = key % size;if (hashkey < 0) {hashkey += size;}return hashkey;}
public:HashTable(int size = 256);~HashTable();void insert(const KeyType& key, const ValueType& value);void remove(const KeyType& key);bool find(const KeyType& key, ValueType& value) const;
};template<typename KeyType, typename ValueType>
HashTable<KeyType, ValueType>::HashTable(int size) {this->size = size;this->table = new HashNode<KeyType, ValueType>* [size];for (int i = -0; i < size; ++i) {this->table[i] = NULL;}
}template<typename KeyType, typename ValueType>
HashTable<KeyType, ValueType>::~HashTable() {for (int i = 0; i < size; ++i) {if (table[i]) {HashNode<KeyType, ValueType>* current = table[i];while (current) {HashNode<KeyType, ValueType>* next = current->next;delete current;current = next;}table[i] = NULL;}}delete[] table;table = NULL;
}template<typename KeyType, typename ValueType>
void HashTable<KeyType, ValueType>::insert(const KeyType& key, const ValueType& value) {int index = hash(key);HashNode<KeyType, ValueType>* now = new HashNode<KeyType, ValueType>(key, value);if (table[index] == NULL) {table[index] = now;}else {now->next = table[index];table[index] = now;}
}template<typename KeyType, typename ValueType>
void HashTable<KeyType, ValueType>::remove(const KeyType& key) {int index = hash(key);if (table[index]) {if (table[index]->key == key) {HashNode<KeyType, ValueType>* next = table[index]->next;delete table[index];table[index] = next;}else {HashNode<KeyType, ValueType>* current = table[index];while (current->next && current->next->key != key) {current = current->next;}if (current->next) {HashNode<KeyType, ValueType>* next = current->next->next;delete current->next;current->next = next;}}}
}template<typename KeyType, typename ValueType>
bool HashTable<KeyType, ValueType>::find(const KeyType& key, ValueType& value) const {int index = hash(key);if (table[index]) {if (table[index]->key == key) {value = table[index]->value;return true;}else {HashNode<KeyType, ValueType>* current = table[index];while (current->next && current->next->key != key) {current = current->next;}if (current->next) {value = current->next->value;return true;}}}return false;
}template<typename KeyType>
class HashCounter {
private:int* counter;int counterIndex;int counterSize;HashTable<KeyType, int>* hash;
public:HashCounter(int size = 256);~HashCounter();void reset();int add(const KeyType& key);int sub(const KeyType& key);int get(const KeyType& key);
};template<typename KeyType>
HashCounter<KeyType>::HashCounter(int size) {counterSize = size;counterIndex = 0;counter = new int[counterSize];hash = NULL;reset();
}template<typename KeyType>
HashCounter<KeyType>::~HashCounter() {delete[]counter;if (hash) {delete hash;hash = NULL;}
}template<typename KeyType>
void HashCounter<KeyType>::reset() {if (hash) {delete hash;hash = NULL;}hash = new HashTable<KeyType, int>(counterSize);counterIndex = 0;for (int i = 0; i < counterSize; ++i) {counter[i] = 0;}
}template<typename KeyType>
int HashCounter<KeyType>::add(const KeyType& key) {int idx;if (!hash->find(key, idx)) {idx = counterIndex++;hash->insert(key, idx);}return ++counter[idx];
}template<typename KeyType>
int HashCounter<KeyType>::sub(const KeyType& key) {int idx;if (hash->find(key, idx)) {return --counter[idx];}return 0;
}template<typename KeyType>
int HashCounter<KeyType>::get(const KeyType& key) {int idx;if (hash->find(key, idx)) {return counter[idx];}return 0;
}int main() {HashCounter<long long> hc(1000);hc.add(14);hc.add(14);hc.add(14);hc.add(14);hc.add(14);hc.add(14);hc.sub(14);cout << hc.get(14) << endl;}