Design HashMap.

关注

原创最新推荐文章于 2026-09-20 11:48:43 发布 315 阅读 AI 写同款· GEO 优化 ›

前沿探索：基于强化学习的目标检测与跟踪技术及论文解析前沿探索：基于强化学习的目标检测与跟踪技术及论文解析，人工智能，计算机视觉，大模型，AI，本文聚焦基于强化学习的目标检测与跟踪技术，先介绍相关技术基础，包括目标检测、跟踪及强化学习的算法等。接着阐述强化学习在目标检测与跟踪中的应用思路、框架及典型算法，解析三篇相关论文的背景、方法、实验结果。还探讨了该技术面临的样本效率、奖励函数设计等挑战，以及结合迁移学习等的未来发展方向，为该领域研究提供参考。阅读详情

// use linked list for chaining.

class LinkedHashEntry {
private:
  int key;
  int value;
  LinkedHashEntry* next;

public:
  LinkedHashEntry(int key, int value) {
    this->key = key;
    this->value = value;
    this->next = NULL;
  }

  int getKey() {
    return key;
  }
  int getValue() {
    return value;
  }
  void setValue(int value) {
    this->value = value;
  }
  LinkedHashEntry* getNext() {
    return next;
  }
  void setNext(LinkedHashEntry *next){
    this->next = next;
  }
}
const int TABLE_SIZE = 128;
class HashMap {
private:
  LinkedHashEntry **table;
public:
  HashMap() {
    table  = new LinkedHashEntry*(TABLE_SIZE);
    for(int i = 0; i < TABLE_SIZE; ++i) {
      table[i] = NULL;
    }
  }

  int get(int key) {
    int hashValue = key %..
    if(table[hashValue] == NULL) {
      return -1;
    } else {
      LinkedHashEntry* entry = table(hashValue);
      while(entry != NULL && entry->getKey()  != key) {
        entry = entry->getNext();
      }
      if(entry == NULL) return -1;
      else return entry->getValue();
    }
  }
  void put(int key, int value) {
    int hashValue = key %...
    if(table[hashValue] == NULL) {
      table[hashValue] = new LinkedHashEntry(key, value);
    } else {
      LinkedHashEntry *entry = table[hashValue];
      while(entry->getNext() != NULL) {
        entry = entry->getNext();
      if(entry->getKey() == key) {entry->setValue(value);}
      else entry->setNext(new LinkedHashEntry(key, value));
    }
  }

  void remove(int key) {
    int hashValue = key % ...
    if(table[hashValue]) {
      LinkedHashEntry *prevEntry = NULL;
      LinkedHashEntry* entry = table[hashValue];
      while(entry->getNext() && entry->getKey() != key) {
        prevEntry = entry;
        entry = entry->getNext();
      }
      if(entry->getKey() == key) {
        if(prevEntry == NULL) {
          LinkedHashEntry* nextEntry = entry->getNext();
          delete entry;
          table[hash] = nextEntry;
        } else {
          LinkedHashEntry *next = entry->getNext();
          delete next;
          prevEntry->setNext(next);
        }
      }
    }
  }
  ~HashMap() {
    for(int i = 0; i < TABLE_SIZE; ++i) {
      if(table[i] != NULL) {
        LinkedHashEntry* prevEntry = NULL;
        LinkedHashEntry* entry = table[i];
        while(entry) {
          prevEntry = entry;
          entry = entry->getNext();
          delete prevEntry;
        }
      }
    }
    delete[] table;
  }
}