链表—— 最基础的动态数据结构

package dataStructure.chapter4;

/**
 * @Author: zjtMeng
 * @Date: 2020/1/1 22:24
 * @Version 1.0
 */
public class LinkedList<E> {

    private class Node{
        public E e;
        public Node next;

        public Node(E e, Node next){
            this.e = e;
            this.next = next;
        }

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

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

        @Override
        public String toString(){
            return e.toString();
        }
    }

    //虚拟头结点
    private Node dummyHead;
    private int size;

    public LinkedList(){
        dummyHead = new Node(null, null);
        size = 0;
    }

    //获取链表中元素的个数；
    public int getSize(){
        return size;
    }

    //返回链表是否为空
    public boolean isEmpty(){
        return size == 0;
    }

    //在链表的index(0-based)位置添加新的元素e
    public void add(int index, E e){
        //验证Index的合法性
        if (index < 0 || index >size)
            throw new IllegalArgumentException("Add failed. Illegal index.");
        //获取插入节点位置前一个节点
        Node prev = dummyHead;
        for (int i=0; i<index ; i++){
            prev = prev.next;
        }
        prev.next = new Node(e, prev.next);
        size++;
    }


    //在链表表头处添加元素
    public void addFirst(E e){
//        Node node = new Node(e);
//        node.next = head;
//        head = new Node(e,head);
        //用下面代码代替上述三行代码的功能
//        head = new Node(e,head);
        add(0,e);
    }

    //在链表末尾处添加新的元素e
    public void addLast(E e){
        add(size,e);
    }

    //获得链表的第index(0-based)个位置的元素
    public E get(int index){
        //验证Index的合法性
        if (index < 0 || index >size)
            throw new IllegalArgumentException("Get failed. Illegal index.");
        //获取插入位置当前的节点
        Node cur =dummyHead.next;
        for (int i = 0; i < index; i++) {
            cur = cur.next;
        }
        return cur.e;
    }

    //获得链表的第一个元素
    public E getFirst(){
        return get(0);
    }

    //获得链表的最后一个元素
    public E getLast(){
        return get(size-1);
    }

    //修改链表的第index(0-based)个位置上的元素为e
    public void setDummyHead(int index, E e){
        //验证Index的合法性
        if (index < 0 || index >size)
            throw new IllegalArgumentException("Set failed. Illegal index.");
        //获取修改位置当前的节点
        Node cur =dummyHead.next;
        for (int i = 0; i < index; i++) {
            cur = cur.next;
        }
        cur.e = e;
    }

    //查找链表中是否存在元素e
    public boolean contains(E e){
        //获取修改位置当前的节点
        Node cur =dummyHead.next;
        while (cur != null){

            if (cur.e .equals(e))
                return true;
            cur = cur.next;
        }
        return false;
//        for (int i = 0; i < size; i++) {
//            if (cur.e == e)
//                return true;
//            cur = cur.next;
//        }
//        return false;
    }

    //从链表中删除第index(0-based)个位置上的元素
    public E remove(int index){
        //验证Index的合法性
        if (index < 0 || index >size)
            throw new IllegalArgumentException("Set failed. Illegal index.");
        //获取修改位置当前的节点
        Node prev =dummyHead;
        for (int i = 0; i < index; i++) {
            prev = prev.next;
        }
        Node delNode = prev.next;
        prev.next = delNode.next;
        delNode.next = null;
        size--;
        return delNode.e;
    }

    //从链表中删除第一个元素
    public E removeFirst(){
        return remove(0);
    }

    //从链表中删除最后一个元素
    public E removeLast(){
        return remove(size-1);
    }



    @Override
    public String toString(){
        StringBuilder  res = new StringBuilder();
        Node cur = dummyHead.next;
        while (cur != null){
            res.append(cur+"->");
            cur = cur.next;
        }

        //此for循环等价于上面的while循环
//        for (Node cur =dummyHead.next; cur != null; cur = cur.next)
//            res.append(cur+"->");

        res.append("NULL");
        return res.toString();
    }

}