2.Java链表

package com;

/**
 * @author DwightYu
 * @单链表实现
 * @create 2022-01-21 9:22 下午
 */
public class LinkedListImlp {
    private int size;
    private Node head;

    public LinkedListImlp(){
        size = 0;
        head = null;
    }
    private class Node{
        private Object data;//每个节点的数据
        private Node next;//每个节点指向下一个节点的连接

        public Node(Object data){
            this.data = data;
        }
    }
    //打印
    public void print(){
        if(size >0){
            Node node = head;
            int tempSize = size;
            if(tempSize == 1){//当前链表只有一个节点
                System.out.println("["+node.data+"]");
                return;
            }
            while(tempSize>0){
                if(node.equals(head)){
                    System.out.print("["+node.data+"->");
                }else if(node.next == null){
                    System.out.print(node.data+"]");
                }else{
                    System.out.print(node.data+"->");
                }
                node = node.next;
                tempSize--;
            }
            System.out.println();
        }else{//如果链表一个节点都没有，直接打印[]
            System.out.println("[]");
        }
    }


    //给node尾添加元素
    public void addNode(Object obj){
        Node newHead = new Node(obj);
        if(size == 0){
            head = newHead;
        }else{
            head.next = newHead;
        }
        size++;
    }

    


}