使用链表实现Map

map我们又叫为映射，即用一个key对应一个value。底层实现可以是链表，也可以是树。我们先用链表实现。

package com.yuanxuzhen.map;

public interface Map<K, V> {
    void add(K key, V value);
    V remove(K key);
    boolean contains(K key);
    V get(K key);
    void set(K key, V value);
    int getSize();
    boolean isEmpty();
}

package com.yuanxuzhen.map;

public class YuanLinklistMap<K, V> implements Map<K, V>{

    private class Node{
        public K key;
        public V value;
        public Node next;

        public Node(K key, V value, Node next) {
            this.key = key;
            this.value = value;
            this.next = next;
        }

        public Node() {
            this(null, null, null);
        }

        public Node(K key) {
            this(key, null, null);
        }

        @Override
        public String toString() {
            return "Node{" +
                    "key=" + key +
                    ", value=" + value +
                    ", next=" + next +
                    '}';
        }
    }

    //虚拟头结点，用来指向链表头
    private Node dummyHead;
    //map中的节点数目
    private int size;

    public YuanLinklistMap() {
        this.dummyHead = new Node();
        this.size = size;
    }


    /**
     * 每次添加都添加在虚拟头结点的后面
     * 如果存在元素，目前的策略是修改
     * @param key
     * @param value
     */
    @Override
    public void add(K key, V value) {
        Node node = getNode(key);
        if(node == null){
            dummyHead.next = new Node(key, value, dummyHead.next);
            ++size;
        }else{
            node.value = value;
        }
    }

    /**
     * 增加prev变量，用来保存删除节点的上一个节点。便于删除节点，并且将后续节点连入prev当中。
     * @param key
     * @return
     */
    @Override
    public V remove(K key) {
        Node prev = dummyHead;
        while (prev.next != null){
            if(prev.next.key.equals(key)){
                break;
            }
            prev = prev.next;
        }
        if(prev.next != null){
            Node delNode = prev.next;
            prev.next = delNode.next;
            delNode.next = null;
            --size;
            return delNode.value;
        }

        return null;
    }

    @Override
    public boolean contains(K key) {
        return getNode(key) != null;
    }

    @Override
    public V get(K key) {
        Node node = getNode(key);
        return node == null?null:node.value;
    }

    @Override
    public void set(K key, V value) {
        Node node = getNode(key);
        if(node != null){
            node.value = value;
        }
    }

    @Override
    public int getSize() {
        return size;
    }

    @Override
    public boolean isEmpty() {
        return size == 0;
    }


    /**
     * 返回key对应的节点，找不到返回null
     * @param key
     * @return
     */
    private Node getNode(K key){
        Node cur = dummyHead.next;
        while (cur != null){
            if(cur.key.equals(key)){
                return cur;
            }
            cur = cur.next;
        }
        return null;
    }
}

gitee地址

DateStructure: 数据结构demo