简易链表实现

class Node {
	private String data;
	private Node next;

	public String getData() {
		return data;
	}

	public void setData(String data) {
		this.data = data;
	}

	public Node getNext() {
		return next;
	}

	public void setNext(Node next) {
		this.next = next;
	}

}

public class LinkDemo {

	/// 根节点
	private static Node root = new Node();
	
	//第一个节点
	private static Node first;

	// 增加节点
	public static void add(Node node) {
		// 先找到最后一个节点,然后将尾节点的next指针指向新节点
		Node current = root;
		Node pNode;
		while ((pNode = current.getNext()) != null) {
			current = pNode;
		}
		current.setNext(node);
	}
	
	//删除节点
	public static void remove(String str) {
		Node current = root;
		Node pNode;
		while ((pNode = current.getNext()) != null) {
			if(str.equals(pNode.getData())) {
				current.setNext(pNode.getNext());
				pNode.setNext(null);
				break;
			}
			current = pNode;
		}
	}
	
	//修改节点
	public static void update(String old,String news) {
		Node current = root;
		Node pNode;
		while ((pNode = current.getNext()) != null) {
			if(old.equals(current.getData())) {
				current.setData(news);
				return;
			}
			current = pNode;
		}
	}

	// 遍历节点
	public static void getAll() {
		Node current = root;
		Node pNode;
		while ((pNode = current.getNext()) != null) {
			current = pNode;
			System.out.println(current.getData());
		}
	}

	public static void main(String[] args) {
		Node node1 = new Node();
		Node node2 = new Node();
		Node node3 = new Node();
		Node node4 = new Node();
		node1.setData("1");
		node2.setData("2");
		node3.setData("3");
		node4.setData("4");
		add(node1);
		add(node2);
		add(node3);
		add(node4);
		remove("3");
		update("1", "11");
		getAll();
	}
}