JAVA_Design HashMap_LeetCode 706

JAVA_Design HashMap_LeetCode 706 풀이 class MyHashMap { int[] map = new int[1000001]; public MyHashMap() { Arrays.fill(data, -1); } public void put(int key, int val) { map[key] = val; } public int get(int key) { return map[key]; } public void remove(int key) { map[key] = -1; } } - hashmap에 맞춰서 데이터를 세팅 할 때 논리 값을 출력 하는 문제 * 출처 Design HashMap - LeetCode Design HashMap - Design a HashMap without using any built-in hash table libraries. Implement the MyHashMap class: * MyHashMap() initializes the objec...

원문링크 : JAVA_Design HashMap_LeetCode 706