LeetCode: #206反转链表

class Solution {
    public ListNode reverseList(ListNode head) {
        //记录原链表的下一个节点
        ListNode next = new ListNode();
        //反转节点的头节点
        ListNode newHead = null;
        ListNode temp = head;
        while (temp != null) {
            //记录下一个节点
            next = temp.next;

            //每遍历一个节点都插在反转链表的头部
            temp.next = newHead;
            newHead = temp;

            temp = next;
        }
        return newHead;
    }
}