LeetCode: Reverse Linked Lis

最新推荐文章于 2022-03-26 13:31:03 发布

wyc1230

最新推荐文章于 2022-03-26 13:31:03 发布

阅读量502

点赞数

分类专栏： LeetCode

本文链接：https://blog.csdn.net/wyc1230/article/details/46343437

版权

LeetCode 专栏收录该内容

186 篇文章 0 订阅

订阅专栏

Reverse a singly linked list.

click to show more hints.

Hint:

A linked list can be reversed either iteratively or recursively. Could you implement both?

Iterative:

/**
 * 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 == NULL)
            return head;
        ListNode *pre = NULL;
        while(head != NULL)
        {
            ListNode *next = head->next;
            head->next = pre;
            pre = head;
            head = next;
        }
        return pre;
    }
};

Recursive:

/**
 * 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) {
        
        recurse(head, NULL);
        return newHead;

    }
private:
    void recurse(ListNode *node, ListNode *pre)
    {
        if(node == NULL)
            return;
        if(node->next == NULL)
            newHead = node;
        ListNode *next = node->next;
        node->next = pre;
        recurse(next, node);

    }
    ListNode *newHead;
};