leetcode 206. Reverse Linked List

最新推荐文章于 2025-12-15 23:25:39 发布

原创最新推荐文章于 2025-12-15 23:25:39 发布 · 299 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#leetcode

算法与数据结构同时被 3 个专栏收录

223 篇文章

订阅专栏

程序员笔试面试

223 篇文章

订阅专栏

Leetcode

179 篇文章

订阅专栏

本文介绍了一种使用迭代和递归方法反转单链表的方法。提供了两种实现方式的代码示例，帮助理解链表反转的基本原理。

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?

递归:

/**
 * 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 || head->next == NULL) return head;
        ListNode* newhead = reverseList(head->next);
        head->next->next = head;
        head->next = NULL;
        return newhead;
    }
};

循环：

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