Java 简单的实现单链表

版权声明：本文为博主原创文章，未经博主允许不得转载。 https://blog.csdn.net/amyacker/article/details/88059116

简单的实现单链表

public class Link<E> {
    private Node<E> head;//头结点
    private int size;//个数

    public Link(){
        this.head = new Node<>();
    }

    //结点
    private class Node<E>{
        private Node<E> next;
        private E element;

        public Node(){
            this.element = null;
            this.next = null;
        }

        public Node(E element){
            this.element = element;
        }
    }

    //头插
    public boolean addHead(E e){
        Node newNode = new Node<>(e);
        newNode.next = this.head.next;
        head.next = newNode;
        size++;
        return true;
    }

    //尾插
    public boolean addTail(E e){
        Node newNode = new Node<>(e);
        Node node = this.head;
        while (node.next!=null){
            node = node.next;
        }
        node.next = newNode;
        size++;
        return true;
    }
    
    //打印
    public void print(){
        Node node = this.head.next;
        while (node!=null){
            System.out.println(node.element);
            node = node.next;
        }
    }

    //删除指定结点
    public boolean remove(int index){
        //检查索引是否合法
        if(index > size || index <= 0 ){
            System.out.println("索引不合法");
            return false;
        }
        Node node = this.head;
        int i = 1;
        //遍历结点
        while (node.next != null){
            //如果指定位置等于i
            if((index) == i) {
                node.next = node.next.next;
                //判断是否为最后的结点
                if(node.next == null){
                    node.next = null;
                    break;
                }
            }
            node = node.next;
            i++;
        }
        size--;
        return true;
    }
    
    //长度
    public int size(){
        return size;
    }