一个JAVA的链表

public class ListNode {
	public int e;
	public ListNode next;
	
	
	public ListNode(int e, ListNode next) {
		this.e = e;
		this.next = next;
	}

	public ListNode(int e) {
		this(e, null);
	}

	public ListNode() {
		this(0, null);
	}

	public ListNode append(int e) {
		this.next = new ListNode(e);
		return this.next;
	}

	@Override
	public String toString() {
		StringBuffer buffer = new StringBuffer();
		
		ListNode cur = this;
		while (cur != null) {
			buffer.append(cur.e + "->");
			cur = cur.next;
		}
		buffer.append("NULL");
		return buffer.toString();
	}
}


package com.sun.list;

public class Solution {
	/**
	 * 反转链表
	 * @param head
	 * @return
	 */
	public ListNode reverseList(ListNode head) {
		//申请节点，pre和 cur，pre指向null
		ListNode pre = null;
		ListNode cur = head;
		ListNode tmp = null;
		while(cur!=null) {
			//记录当前节点的下一个节点
			tmp = cur.next;
			//然后将当前节点指向pre
			cur.next = pre;
			//pre和cur节点都前进一位
			pre = cur;
			cur = tmp;
		}
		return pre;
	}
	
	public static void main(String[] args) {
		ListNode head = new ListNode(1);
		head.append(2)
			.append(3)
			.append(4)
			.append(5)
			.append(6)
			.append(7);

		ListNode res = new Solution().reverseList(head);
		System.out.println(res);
		
	}
}