Linked list -------------------------- tail insertion method

First, create an instance of the linked list , Used to pass in values

ListNode temp1 = new ListNode(value);

First, determine whether there is a header node If not , The first value is the head node
        if(head==null) {head = temp1; return;}

If head Of next It's empty.

    ListNode temp2 = head;

temp2.next =temp1;

If headnext Not empty

        while(temp2.next!=null) {
            temp2 = temp2.next;
        }

All code diagrams

ListNode：

public class ListNode {
int value;
ListNode next;// The address field of the next object 

public ListNode(int value){
    this.value = value;
}

@Override
public String toString() {
	return "ListNode [value=" + value + ", next=" + next + "]";
}
	
}

Test：

public class Test {
public static void main(String[] args) {
	LinkList linkList = new LinkList();
	linkList.insert(1);
	linkList.insert(2);
	linkList.insert(3);
	linkList.insert(4);
	linkList.insert(5);
	 System.out.println(linkList.head);
	}

}

public class LinkList {

	public ListNode head ;
	public void insert(int value) {
		ListNode temp1 = new ListNode(value);
		
		if(head==null) {
			 head = temp1;
			return;
		}
		ListNode temp2 = head;
		while(temp2.next!=null) {
			temp2 = temp2.next;
		}
		temp2.next = temp1;
		
	}
}

=