反转链表(简单)

最新推荐文章于 2024-10-08 10:36:00 发布

geriezmann

最新推荐文章于 2024-10-08 10:36:00 发布

阅读量374

点赞数 1

分类专栏： LeetCode 文章标签： leetcode c++ python

本文链接：https://blog.csdn.net/adhkcnbk/article/details/123589025

版权

LeetCode 专栏收录该内容

3 篇文章 0 订阅

订阅专栏

反转链表

1、双指针

struct ListNode
{
    int val;
    ListNode* next;
    ListNode(int x):val(x), next(nullptr){}
};
class Solution{
    ListNode* reverseList(ListNode* head){
        ListNode* temp;
        ListNode* cur = head;
        ListNode* pre = NULL;
        while(cur)
        {
            temp = cur.next;
            cur.next = pre;
            pre = cur;
            cur = temp;
        }
        return pre;
    }
}

class ListNode:
    def __init__(self, val = 0; next = None):
        self.val = val
        self.next = None
class Solution:
    def reverseList(self, head):
        pre = None
        cur = head
        while(cur):
            temp = cur.next
            cur.next = pre
            pre = cur
            cur = temp
        return pre

2、递归法

struct ListNode{
    int val;
    ListNode* next;
    ListNode(x): val(x), next(nullptr){}
};
class Solution
{
    ListNode* reverse(ListNode*pre, ListNode*cur)
    {
        if(cur == NULL)
        {
            return pre;
        }
        ListNode*temp = cur.next;
        cur.next = pre;
        return reverse(cur, temp);
        
    }
    
    ListNode* reverseList(ListNode* head){
        reverse(NULL, head);
    }
}

class Solution:
    def reverse(self, pre, cur):
        if(cur == None):
            return pre;
        temp = cur.next
        cur.next = pre
        return self.reverse(cur, temp)
    def reverseList(self, head):
        return self.reverse(None, head)