java实现单链表（删除时超过链表范围则抛出NoSuchElementException()异常）

import java.util.LinkedList;
import java.util.NoSuchElementException;
import java.util.Objects;

public class DanLianBiao<E> {  
    private    Node<E>  first;
   public   DanLianBiao()   //初始化 实例单链表对象
   {
       first=new Node<>(null,null);
   }

   public  void  put(E e){   //添加元素
       Node<E> curr=first;
       while (curr.next!=null){
             curr=curr.next;
       }
       curr.next=new Node<E>(e,null);
   }
   public void  out(){    //输出元素
       Node<E>  curr=first;
       while (curr.next!=null) {
           curr=curr.next;
           System.out.println(curr.e);       }
       }
    public  E  RemoveFirst(){     //从前删除 并且返回最前面的值
       E remove;
       if(first.next!=null) {
           remove=first.next.e;
           first.next = first.next.next;
           return remove;
       }
         throw new NoSuchElementException();   
    }
    public  boolean  isExist(E e){  //元素是否存在
       Node<E> curr=first;
       while (curr.next!=null)
       {
           boolean bool=Objects.equals(curr.next.e,e);
           if(bool)
                return bool;
           curr=curr.next;
       }
       return  false;
    }
    public  boolean isEmpty()   //元素是否为空
    {
        return first.next==null;
    }

    

    private  static  class  Node<E>{  //创建Node类 类部节点
        E e;
        Node<E>  next;
        Node(E e,Node<E> next){
            this.e=e;
            this.next=next;
        }
    }
}