单向链表的简单实现--Java

public class Node {
    Node next;
    Object data;

    public Node(Object data){
        this.data = data;
    }
    
}
class Linked_List(){
    Node head;
    
    /**
     * 查询链表中的元素个数
     */
    public int getLen(){
        Node cur = head.next;
        int count = 1;
        if(cur == null){
            return -1;
        }else{
            while(cur.next != null){
                count++;
                cur = cur.next;
            }
            return count;
        }
    }

    /**
     * 添加元素
     * @param node
     */
    public void add(Node node){
        Node temp = head;
        while(temp.next != null){
            temp = temp.next;
        }
        temp.next = node;
    }

    /**
     * 按data删除元素
     */
    public void del(Node node){
        Node temp = head;
        while(temp.next.data.equals(node.data)||temp.next == null){
            temp = temp.next;
        }
        if(temp.next == null){
            System.out.println("未找到元素");
        }else{
            temp.next = temp.next.next;
        }
    }

    /**
     * 遍历链表
     */
    public void show(){
        Node temp = head.next;
        if(temp != null){
            while(temp.next != null){
                System.out.println(temp);
                temp = temp.next;
            }
        }else{
            System.out.println("链表为空");
        }
    }

}