GeezerVisonThe World Wide Web, restored to 800 pixels of glory. |
| Home|About|Gaming cabinet|Archives|How it works|Starter sites |
GeezerVison is showing github.com — leetcode-algorithms/src/DesignHashSet.java at master · anishLearnsToCode/leetcode-algorithms Expand file tree/ Copy pathDesignHashSet.javaMore file actions 61 lines (49 loc) · 1.6 KB / Copy pathDesignHashSet.javaFile metadata and controls61 lines (49 loc) · 1.6 KB 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 import java.util.LinkedList; import java.util.Queue; public class DesignHashSet { class MyHashSet { private static final int INITIAL_SIZE = 100; private final Bucket[] buckets; private int size = 0; public MyHashSet() { this.buckets = new Bucket[INITIAL_SIZE]; initializeBuckets(); } public MyHashSet(int initialSize) { this.buckets = new Bucket[initialSize]; initializeBuckets(); } public void add(int element) { int hash = element % buckets.length; if (!buckets[hash].contains(element)) { buckets[hash].add(element); this.size++; } } public void remove(int element) { buckets[element % buckets.length].remove(element); } public boolean contains(int element) { return buckets[element % buckets.length].contains(element); } private void initializeBuckets() { for (int index = 0 ; index < buckets.length ; index++) { buckets[index] = new Bucket(); } } private class Bucket { Queue<Integer> list = new LinkedList<>(); public boolean contains(int element) { return list.contains(element); } public void add(int element) { if (!this.contains(element)) { list.add(element); } } public void remove(int element) { list.remove(element); } } } } |
| You are visitor 01402503 — GeezerVison does not store the pages you look up. Best viewed with Netscape Navigator 4.7 or Internet Explorer 6 at 800×600. No cookies required. |