C++ std::vector中push_back操作空间溢出

---

今天在做leetcode 705、706时候遇到一个错误。
题链接：https://leetcode.com/problems/design-hashmap/description/

• [817] Design HashMap * *
  https://leetcode.com/problems/design-hashmap/description/ * *
  algorithms * Easy (48.96%) * Total Accepted: 9.2K * Total
  Submissions: 18.8K * Testcase Example:
  ‘[“MyHashMap”,“put”,“put”,“get”,“get”,“put”,“get”, “remove”,
  “get”]\n[[],[1,1],[2,2],[1],[3],[2,1],[2],[2],[2]]’ * * Design a
  HashMap without using any built-in hash table libraries. * * To be
  specific, your design should include these functions: * * *
  put(key, value) : Insert a (key, value) pair into the HashMap. If the
  value * already exists in the HashMap, update the value. * get(key):
  Returns the value to which the specified key is mapped, or -1 if *
  this map contains no mapping for the key. * remove(key) : Remove the
  mapping for the value key if this map contains the * mapping for the
  key. * * * * Example: * * * MyHashMap hashMap = new
  MyHashMap(); * hashMap.put(1, 1); * hashMap.put(2, 2);
• hashMap.get(1); // returns 1 * hashMap.get(3); // returns -1 (not found) * hashMap.put(2, 1); // update the
  existing value * hashMap.get(2); // returns 1 *
  hashMap.remove(2); // remove the mapping for 2 *
  hashMap.get(2); // returns -1 (not found) * * * *
  Note: * * * All keys and values will be in the range of [0,
  1000000]. * The number of operations will be in the range of [1,
  10000]. * Please do not use the built-in HashMap library.

题目要求实现一个hash表
在实现过程中使用了vector<int>进行模拟，但是令人想不到的是不是时间超时，而是空间溢出。QAQ？？？纳尼？
代码:

class MyHashMap {
   
    private:
    vector<