反转链表

在断裂之前将下一个节点保存下来

import java.util.Stack;
public class Solution {
public ListNode ReverseList(ListNode head) {
if(head == null ) return null;

ListNode pre = null;
ListNode next = null;

while(head != null){
next = head.next;
head.next = pre;

pre = head;
head = next;
}
return pre;
}
}

反转链表

原文：http://www.cnblogs.com/lycroseup/p/6827504.html