LeetCode 206. Reverse Linked List

最新推荐文章于 2022-10-08 18:10:16 发布

David_DLUT

最新推荐文章于 2022-10-08 18:10:16 发布

阅读量241

点赞数

分类专栏： LeetCode 文章标签： leetcode

本文链接：https://blog.csdn.net/David_DLUT/article/details/53941539

版权

LeetCode 专栏收录该内容

42 篇文章 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) {
        ListNode *pre = NULL;
        while (head != NULL) {
            ListNode *cur = head;
            head = head->next;
            cur->next = pre;
            pre = cur;
        }
        return pre;
    }
};

/**       Recursion
* class Solution {
* public:
*     ListNode* reverseList(ListNode* head) {
*         if ((head == NULL) || (head->next == NULL)) {
*             return head;
*         }
*         ListNode *rest = reverseList(head->next);
*         head->next->next = head;
*         head->next = NULL;
*         return rest;
*     }
* };
*/