数据结构与算法（一）——链表反转

public class Demo {

	public static void main(String[] args) {
		// 单链表反转
		Node node = getNode(10);
		print(node);
		System.out.println("---------------------------");
		Node reverseList = reverseList(node);
		print(reverseList);

	}

	// 反转
	private static Node reverseList(Node node) {
		Node prev = null;
		while (node != null) {
			Node next = node.next;
			node.next = prev;
			prev = node;
			node = next;
		}
		return prev;
	}

	// 获取链表
	private static Node getNode(Integer n) {
		Node node = null;
		Node head = null;
		for (int i = 1; i <= n; i++) {
			Node next = new Node(i);
			if (node == null) {
				node = next;
				head = next;
			} else {
				node.next = next;
				node = next;
			}
		}
		return head;
	}

	private static void print(Node node) {
		StringBuilder s = new StringBuilder();
		while (node != null) {
			if (s.length() == 0) {
				s.append(node.value);
			} else {
				s.append(" --> " + node.value);
			}
			node = node.next;
		}
		System.out.println(s.toString());
	}

	static class Node {
		public Node next;
		public Integer value;

		public Node(Integer value) {
			this.value = value;
		}
	}
}