首页 » 编程之美 » 正文

[leetcode_206]Reverse Linked List

反转单链表。

class Solution {
public:
    ListNode* reverseList(ListNode* head) {
        if (NULL == head)
        {
            return head;
        }
        ListNode * before = NULL;
        ListNode * now = head;
        ListNode * next = now-&gt;next;</p>

<pre><code>    while (NULL != next)
    {
        ListNode * beforeTmp = now;
        ListNode * nowTmp = next;
        ListNode * nextTmp = next-&amp;gt;next;

        now-&amp;gt;next = before;
        next-&amp;gt;next = now;

        before = beforeTmp;
        now = nowTmp;
        next = nextTmp;
    }

    head = now;
    return head;
}
</code></pre>

<p>};

发表评论