数据结构-链式存储线性表

链式存储结构的线性表（简称为链表）将采用一组地址任意的存储单元存放线性表中的数据元素，链式结构的线性表不会按线性的逻辑顺序来保存数据元素，它需要在每一个数据元素里保存一个引用下一个数据元素的引用。

优点：插入、删除元素快，充分利用计算机内存空间

缺点：查找元素需要整体遍历，空间开销大

单链表：

/**
 * Created by Administrator on 2018/3/13.
 */
public class LinkList<T> {

    //定义一个内部类 Node，Node实例代表链表的节点
    private class Node {
        //保存节点的数据
        private T data;
        //指向下个节点的引用
        private Node next;

        public Node() {

        }

        public Node(T data, Node next) {
            this.data = data;
            this.next = next;
        }
    }

    //保存该链表的头节点
    private Node header;
    //保存该链表的尾节点
    private Node tail;
    //保存该链表中已包含的节点数
    private int size;

    //创建空链表
    public LinkList() {
        header = null;
        tail = null;
    }

    //以指定数据元素来创建链表，该链表只有一个元素
    public LinkList(T element) {
        header = new Node(element, null);
        //只有一个节点，header、tail都指向该节点
        tail = header;
        size++;
    }

    //返回链表长度
    public int length() {
        return size;
    }

    //获取链式线性表中索引为index处的元素
    public T get(int index) {
        return getNodeByIndex(index).data;
    }

    //根据索引 index 获取指定位置的节点
    private Node getNodeByIndex(int index) {
        if (index < 0 || index > size - 1) {
            throw new IndexOutOfBoundsException("线性表索引越界");
        }
        //从 header 节点开始
        Node current = header;
        for (int i = 0; i < size && current != null; i++, current = current.next) {
            if (i == index) {
                return current;
            }
        }
        return null;
    }

    //查找链式线性表中指定元素的索引
    public int locate(T element) {
        //从头节点开始
        Node current = header;
        for (int i = 0; i < size && current != null; i++, current = current.next) {
            if (current.data.equals(element)) {
                return i;
            }
        }
        return -1;
    }

    public void insert(T element, int index) {
        if (index < 0 || index > size) {
            throw new IndexOutOfBoundsException("线性表索引越界");
        }
        if (header == null) {
            add(element);
        } else {
            if (index == 0) {
                //从头部插入
                addAtHeader(element);
            } else {
                //获取插入点的前一个节点
                Node prev = getNodeByIndex(index - 1);
                prev.next = new Node(element, prev.next);
                size++;
            }
        }
    }

    //采用尾插法为链表添加新节点
    public void add(T element) {
        if (header == null) {
            header = new Node(element, null);
            tail = header;
        } else {
            Node newNode = new Node(element, null);
            tail.next = newNode;
            tail = newNode;
        }
        size++;
    }

    //采用头插法为链表添加新节点
    public void addAtHeader(T element) {
        header = new Node(element, header);
        if (tail == null) {
            tail = header;
        }
        size++;
    }

    //删除链式线性表中指定索引处的元素
    public T delete(int index) {
        if (index < 0 || index > size - 1) {
            throw new IndexOutOfBoundsException("线性表索引越界");
        }
        Node del = null;
        if (index == 0) {
            del = header;
            header = header.next;
        } else {
            Node prev = getNodeByIndex(index - 1);
            del = prev.next;
            prev.next = del.next;
            del.next = null;
        }
        size--;
        return del.data;
    }

    //删除链式线性表中的最后一个元素
    public T remove() {
        return delete(size - 1);
    }

    public boolean empty() {
        return size == 0;
    }

    public void clear() {
        header = null;
        tail = null;
        size = 0;
    }

    public String toString() {
        if (empty()) {
            return "[]";
        } else {
            StringBuilder sb = new StringBuilder("[");
            //从头节点开始
            Node current = header;
            for (int i = 0; i < size && current != null; i++, current = current.next) {
                if (i > 0) {
                    sb.append(", ");
                }
                sb.append(current.data.toString());
            }
            sb.append("]");
            return sb.toString();
        }
    }

    public static void main(String[] args) {
        LinkList<String> list = new LinkList<>();
        list.insert("aaaa", 0);
        list.add("bbbb");
        list.add("cccc");
        list.insert("dddd", 1);
        System.out.println(list);
        list.delete(2);
        System.out.println(list);
        System.out.println("cccc在链表中的位置：" + list.locate("cccc"));
        System.out.println("链表中索引2处的元素：" + list.get(2));
    }
}

循环链表：首尾相接的链表，将单链表的尾节点next指向单链表header节点

双向链表：每个节点保留两个引用 prev 和 next，让prev指向当前节点的上一个节点，让next指向当前节点的下一个节点。

/**
 * Created by Administrator on 2018/3/13.
 */
public class DuLinkList<T> {

    //定义一个内部类 Node，Node实例代表链表的节点
    private class Node {
        //保存节点的数据
        private T data;
        //指向上个节点的引用
        private Node prev;
        //指向下个节点的引用
        private Node next;

        public Node() {
        }

        public Node(T data, Node prev, Node next) {
            this.data = data;
            this.prev = prev;
            this.next = next;
        }
    }

    //保存该链表的头节点
    private Node header;

    //保存该链表的尾节点
    private Node tail;

    //保存该链表中已包含的节点数
    private int size;

    public DuLinkList() {
        header = null;
        tail = null;
    }

    public DuLinkList(T element) {
        header = new Node(element, null, null);
        tail = header;
        size++;
    }

    public int length() {
        return size;
    }

    public T get(int index) {
        return getNodeByIndex(index).data;
    }

    private Node getNodeByIndex(int index) {
        if (index < 0 || index > size - 1) {
            throw new IndexOutOfBoundsException("线性表索引越界");
        }
        if (index <= size / 2) {
            //从 header 节点开始检索
            Node current = header;
            for (int i = 0; i <= size / 2 && current != null; i++, current = current.next) {
                if (i == index) {
                    return current;
                }
            }
        } else {
            Node current = tail;
            for (int i = size - 1; i < size / 2 && current != null; i++, current = current.prev) {
                if (i == index) {
                    return current;
                }
            }
        }
        return null;
    }

    public int locate(T element) {
        Node current = header;
        for (int i = 0; i < size && current != null; i++, current = current.next) {
            if (current.data.equals(element)) {
                return i;
            }
        }
        return -1;
    }

    public void insert(T element, int index) {
        if (index < 0 || index > size) {
            throw new IndexOutOfBoundsException("线性表索引越界");
        }
        if (header == null) {
            add(element);
        } else {
            if (index == 0) {
                addAtHeader(element);
            } else {
                Node prev = getNodeByIndex(index - 1);
                Node next = prev.next;

                Node newNode = new Node(element, prev, next);

                prev.next = newNode;
                next.prev = newNode;
                size++;
            }
        }
    }

    public void add(T element) {
        if (header == null) {
            header = new Node(element, null, null);
            tail = header;
        } else {
            Node newNode = new Node(element, tail, null);
            tail.next = newNode;
            tail = newNode;
        }
        size++;
    }

    public void addAtHeader(T element) {
        header = new Node(element, null, header);
        if (tail == null) {
            tail = header;
        }
        size++;
    }

    public T delete(int index) {
        if (index < 0 || index > size - 1) {
            throw new IndexOutOfBoundsException("线性表索引越界");
        }
        Node del = null;
        if (index == 0) {
            del = header;
            header = header.next;
            header.prev = null;
        } else {
            Node prev = getNodeByIndex(index - 1);
            del = prev.next;
            prev.next = del.next;
            if (del.next != null) {
                del.next.prev = prev;
            }
            del.prev = null;
            del.next = null;
        }
        size--;
        return del.data;
    }

    public T remove() {
        return delete(size - 1);
    }

    public boolean empty() {
        return size == 0;
    }

    public void clear() {
        header = null;
        tail = null;
        size = 0;
    }

    public String toString() {
        if (empty()) {
            return "[]";
        } else {
            StringBuilder sb = new StringBuilder("[");
            Node current = header;
            for (int i = 0; i < size && current != null; i++, current = current.next) {
                if (i > 0) {
                    sb.append(", ");
                }
                sb.append(current.data.toString());
            }
            sb.append("]");
            return sb.toString();
        }
    }

    public String reverseToString() {
        if (empty()) {
            return "[]";
        } else {
            StringBuilder sb = new StringBuilder("[");
            Node current = tail;
            for (int i = size - 1; i >= 0 && current != null; i--, current = current.prev) {
                if (i < size - 1) {
                    sb.append(", ");
                }
                sb.append(current.data.toString());
            }
            sb.append("]");
            return sb.toString();
        }
    }

    public static void main(String[] args) {
        DuLinkList<String> list = new DuLinkList<>();
        list.insert("aaaa", 0);
        list.add("bbbb");
        list.insert("cccc", 0);
        list.insert("dddd", 1);
        System.out.println(list);
        System.out.println(list.reverseToString());
        list.delete(2);
        System.out.println(list);
        System.out.println(list.reverseToString());
        System.out.println("cccc在链表中的位置:" + list.locate("cccc"));
        list.remove();
        System.out.println(list);
        list.delete(0);
        System.out.println(list);
    }
}