双向链表和数组实现HashSet

最新推荐文章于 2022-01-07 23:25:42 发布

原创最新推荐文章于 2022-01-07 23:25:42 发布 · 290 阅读

0 ·

CC 4.0 BY-SA版权

Java 专栏收录该内容

79 篇文章

订阅专栏

本文详细介绍了一种自定义哈希集合（MyHashSet）的实现方法，使用链地址法解决冲突，通过节点类（Node）构成链表存储元素。文章深入解析了初始化、添加、删除及查找元素的算法流程。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

class MyHashSet {
    class Node{
        int val;
        Node prev,next;

        Node(int val){
            this.val = val;
        }
    }

    private int length = 100;
    private Node[] data = new Node[length];
    /** Initialize your data structure here. */
    public MyHashSet() {

    }
    
    public void add(int key) {
        int index = key % length;
        Node curr = data[index];
        if (curr == null) {
            Node node = new Node(key);
            data[index] = node;
            return;
        }
        while(true) {
            if (curr.val == key) {
                return;
            }
            if(curr.next == null) {
                Node node = new Node(key);
                node.prev = curr;
                curr.next = node;
                return;
            } else {
                curr = curr.next;
            }
        }
    }
    
    public void remove(int key) {
        int index = key % length;
        Node curr = data[index];
        if (curr != null && curr.val == key) {
            Node next = curr.next;
            if (next != null) {
                next.prev = null;
            }
            data[index] = next;
            return;
        }
        while(curr != null) {
            if (curr.val == key) {
                Node next = curr.next;
                Node prev = curr.prev;
                if (next != null) {
                    next.prev = prev;
                }
                if (prev != null) {
                    prev.next = next;
                }
                return;
            }
            curr = curr.next;
        } 
    }
    
    /** Returns true if this set contains the specified element */
    public boolean contains(int key) {
        int index = key % length;
        Node curr = data[index];
        while(curr != null) {
            if (curr.val == key) {
                return true;
            }
            curr = curr.next;
        }
        return false;
    }
}

/**
 * Your MyHashSet object will be instantiated and called as such:
 * MyHashSet obj = new MyHashSet();
 * obj.add(key);
 * obj.remove(key);
 * boolean param_3 = obj.contains(key);
 */