首页 > 其他 > 详细

206. Reverse Linked List (List)

时间:2015-12-28 20:25:07      阅读:149      评论:0      收藏:0      [点我收藏+]

Reverse a singly linked list.

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode(int x) : val(x), next(NULL) {}
 * };
 */
class Solution {
public:
    ListNode* reverseList(ListNode* head) {
        if(!head) return head;
        
        ListNode* preHead = head;
        ListNode* current = preHead->next;
        ListNode* curNext;
        head->next = NULL;
        
        while(current){
            curNext = current->next;
            current->next = preHead;
            preHead = current;
            current = curNext;
        }
        return preHead;
    }
};

 

206. Reverse Linked List (List)

原文:http://www.cnblogs.com/qionglouyuyu/p/5083531.html

(0)
(0)
   
举报
评论 一句话评论(0
关于我们 - 联系我们 - 留言反馈 - 联系我们:wmxa8@hotmail.com
© 2014 bubuko.com 版权所有
打开技术之扣,分享程序人生!