[LeetCode] 705. Design HashSet - Java

• 문제 링크

Design HashSet - LeetCode

 

• 풀이 코드

public class MyHashSet {

    private final boolean[] arr;

    public MyHashSet() {
        arr = new boolean[1000001];
    }

    public void add(int key) {
        arr[key] = true;
    }

    public void remove(int key) {
        arr[key] = false;
    }

    public boolean contains(int key) {
        return arr[key];
    }

}