webstorm

if (head == null){
            head = new Node<>(val);
            head.next = head;
            size++;
            return;
        }
        //非空链表常规操作
        Node newNode = new Node(val);
        //缓存头节点
        Node node = head;
        //遍历至尾结点出
        while (node.next != head){
            node = node.next;
        }
        //将节点加在尾部
        node.next = newNode;
        newNode.next = head;
        size++;
    }

    //删除指定位置元素
    public boolean remove(E val){
        //判断链表为空
        if (head == null){
            System.out.println("链表为空删除失败");