Java单链表实现

package com.linjiinbao;

/**
 * 顺序表的链式存储是实现
 * @author linji
 *
 */
public class MyNode {
	
	public Node first;
	
	public void addNode(Node node) {
		if(first == null) {
			first = node;
		}else {
			Node tmp = first;
			first = node;
			first.next = tmp;
		}
	}
	public void printDode(Node first) {
		while(first != null) {
			int data = first.data;
			System.out.println(data);
			first = first.next;
		}
	}
	public static void main(String[] args) {
		MyNode mynode = new MyNode();
		Node node1 = new Node(5);
		Node node2 = new Node(6);
		Node node3 = new Node(8);
		
		mynode.addNode(node1);
		mynode.addNode(node2);
		mynode.addNode(node3);
		
		mynode.printDode(node3);
		
	}
}
class Node{
	int data;
	Node next;
	Node(int val){
		data = val;
	}
}

 

转载于:https://my.oschina.net/u/3693752/blog/1852810