链表小试-java实现

public class LinkNode{
	String name;
	LinkNode next;
	
	public LinkNode()
	{
		
	}
	
	public LinkNode(String n1,LinkNode n2){
		this.name=n1;
		this.next=n2;
	}
}

public class TestLinkNode {
    public static void main(String[] args) {
        LinkNode node1;
        LinkNode node2;
        LinkNode node3;
        LinkNode node4;
        LinkNode node5;

        node5 = new LinkNode("fifth", null);

        node4 = new LinkNode("forth", node5);

        node3 = new LinkNode("third", node4);

        node2 = new LinkNode("second", node3);

        node1 = new LinkNode("first", node2);

        /*iterate the linkList*/

        //declare var:node
        LinkNode node;
        //initial var:node
        node = node1;

        while (node != null) {
            //print node.name
            System.out.printf("%s -> \n", node.name);

            if (node.next == null) {
                break;
            } else {
                //node->next
                node = node.next;
            }
        }

        //in the end ,node point to the last node:node5
        System.out.printf("in the end ,node point to the last node:%s\n",
            node.name);
    }
}