码迷,mamicode.com
首页 > 其他好文 > 详细

LeetCode 706. Design HashMap (设计哈希映射)

时间:2019-05-19 10:23:20      阅读:161      评论:0      收藏:0      [点我收藏+]

标签:目标   hashmap   problems   参考   ash   struct   ram   etc   derby   

题目标签:HashMap

  题目让我们设计一个 hashmap, 有put, get, remove 功能。

  建立一个 int array, index 是key, 值是 value,具体看code。

 

Java Solution:

Runtime: 76 ms, faster than 27.53% 

Memory Usage: 58.2 MB, less than 31.57%

完成日期:03/18/2019

关键点:int array

class MyHashMap {

    int [] map;
    /** Initialize your data structure here. */
    public MyHashMap() {
        map = new int[1000001];
        Arrays.fill(map, -1);
    }
    
    /** value will always be non-negative. */
    public void put(int key, int value) {
        map[key] = value;
    }
    
    /** Returns the value to which the specified key is mapped, or -1 if this map contains no mapping for the key */
    public int get(int key) {
        return map[key];
    }
    
    /** Removes the mapping of the specified value key if this map contains a mapping for the key */
    public void remove(int key) {
        map[key] = -1;
    }
}

/**
 * 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);
 */

参考资料:N/A

LeetCode 题目列表 - LeetCode Questions List

题目来源:https://leetcode.com/

LeetCode 706. Design HashMap (设计哈希映射)

标签:目标   hashmap   problems   参考   ash   struct   ram   etc   derby   

原文地址:https://www.cnblogs.com/jimmycheng/p/10888012.html

(0)
(0)
   
举报
评论 一句话评论(0
登录后才能评论!
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!