[Java]单向链表 ，循环链表的简单使用方法

//链式结构 Node节点，其中不仅包含了数据， 也·包含了一下节点的地址

//单项链表
public class  NodeTest
{
		public static void main(String[] args)
		{
			Node node1 = new Node("node1");
			
			Node node2 = new Node("node2");
			
			Node node3 = new Node("node3");
			
			Node node4 = new Node("node4");
			
			node1.next = node2;
			
			node2.next = node3;
			
			node3.next = node4;
			
			System.out.println(node2.next.next.data);
		}
}

class Node
{
	String data;
	
	Node next;
	
	public Node(String da)  
	{
		this.data = da;  //这里为什么这样，因为da已经赋值了啊，所以再将data赋值才行
	}
}

运行的结果是：node4

<pre name="code" class="java">结果是：二、循环链表的使用<p></p><pre name="code" class="java">//双向链表  ，双向链表中节点不仅存数据，而且存这上一节点和下一节点的地址
class Node2
{
	Node2 previous;
	
	String data;
	
	Node2 next;
	
	public Node2(String da)
	{
		this.data = da;
	}
	
}

public class NodeTest2
{
	public static void main(String[] args)
	{
		Node2 node1 = new Node2("node1");
		Node2 node2 = new Node2("node3");
		Node2 node3 = new Node2("node3");
		Node2 node4 = new Node2("node4");
		Node2 node5 = new Node2("node5");
		
		
		node1.next = node2;
		node2.next = node3;
		node3.next = node4;
		node4.next = node5;
		node5.next = node1;
		
		node1.previous = node5;
		node2.previous = node1;
		node3.previous = node2;
		node4.previous = node3;
		node5.previous = node4;
		
		
		System.out.println(node2.next.next.data);
		
		System.out.println(node2.previous.previous.data);
	}
}

运行的结果是

<p>node4
node3</p>