思路:我建立一个新的头,然后依次地转移原来的旧头,到新头。
public class Solution {
public ListNode reverseList(ListNode head) {
if (head == null) return null;
ListNode newHead = head;
ListNode tmp;
head = head.next;
newHead.next = null;
while (head != null) {
tmp = head;
head = head.next;
tmp.next = newHead;
newHead = tmp;
}
return newHead;
}
}