0
点赞
收藏
分享

微信扫一扫

【Leetcode_easy】706. Design HashMap

王小沫 2022-07-12 阅读 111
编程语言

problem

​​706. Design HashMap​​

solution1:

class MyHashMap {
public:
/** Initialize your data structure here. */
MyHashMap() {
data.resize(1000000, -1);//errr...
}

/** value will always be non-negative. */
void put(int key, int value) {
data[key] = value;
}

/** Returns the value to which the specified key is mapped, or -1 if this map contains no mapping for the key */
int get(int key) {
return data[key];
}

/** Removes the mapping of the specified value key if this map contains a mapping for the key */
void remove(int key) {
data[key] = -1;//err....
}
vector<int> data;
};

/**
* Your MyHashMap object will be instantiated and called as such:
* MyHashMap* obj = new MyHashMap();
* obj->put(key,value);
* int param_2 = obj->get(key);
* obj->remove(key);
*/

solution2:

 

 

参考

1. ​​Leetcode_easy_706. Design HashMap​​;

2. ​​Grandyang​​;

举报

相关推荐

0 条评论