技術標籤：java語法遍歷java連結串列單鏈表

通過遍歷，找到連結串列中最後一個結點
首先建立一個連結串列，然後再找到連結串列的最後一個結點
程式碼例項：

class Node {
    public int val;
    public Node next;

    public Node(int val) {
        this.val = val;
    }
}
public  class MyLinkedList {

    public Node head;//普通引用，目的是讓head一直指向當前列表的頭

    public void createLinked
 
() {
        this.head = new Node(12);
        Node node2 = new Node(22);
        Node node3 = new Node(32);
        Node node4 = new Node(42);
        head.next = node2;
        node2.next = node3;
        node3.next = node4;
    }

    public void display() {
        Node cur = this.head;
        while
 
 (cur != null) {
            System.out.print (cur.val +" ");
            cur = cur.next;
        }
        System.out.println();
    }
   public  Node findLastNode() {
       Node cur = this.head;
       while (cur.next != null) {
           cur = cur.next;
       }
       return cur;
   }
 

    public static void main(String[] args) {
        MyLinkedList myLinkedList = new MyLinkedList();
        myLinkedList.createLinked();
        myLinkedList.display();
        Node ret = myLinkedList.findLastNode();
        System.out.println(ret.val);
    }

結果：