leetcode刷题_OJ 206链表逆转

Reverse a singly linked list.

Example:

Input: 1->2->3->4->5->NULL
Output: 5->4->3->2->1->NULL
我用了迭代的方法实现，一开始不是很懂的可以看博客，有图很详细，后来参考了别人的解答用了更简洁一点的写法，具体如下：

Really a genius solution! Here I focused on the iterative one, and I slightly change the naming of variables to make it easier to understand (for newbies like me!).

I use three pointers: prevHead, head, recordNext.

Basic idea here is that there are always three pointers, which are represented in sequence as prevHead, head, recordNext. Everytime in loop just make head.next points to prevHead, and then move all these three pointers to one next step.

Since when we exit the while loop, head is pointing to null, so prevHead points to the end node of original list, and thus we return prevHead.
/**
 * Definition for singly-linked list.
 * public class ListNode {
 *     int val;
 *     ListNode next;
 *     ListNode(int x) { val = x; }
 * }
 */
class Solution {
    public ListNode reverseList(ListNode head) {
        ListNode tail=null;
        while(head != null){
            ListNode second=head.next;//记录第一个节点的位置
            head.next=tail;//断开中间节点原来与下一个节点的连接
            tail=head;
            head=second;
        }
        return tail;
    }
}