leetcode学习笔记(反转链表-迭代/递归)

2023好运来

于 2021-10-12 10:41:07 发布

阅读量87

点赞数

分类专栏：学习记录文章标签： leetcode

本文链接：https://blog.csdn.net/qq_43656500/article/details/120718461

版权

学习记录专栏收录该内容

103 篇文章 0 订阅

订阅专栏

206. 反转链表

在这里插入图片描述

迭代

class Solution:
    def reverseList(self, head: ListNode) -> ListNode:
        pre = None
        cur = head

        while(cur):
            next = cur.next
            cur.next = pre
            pre = cur
            cur = next
            
        return pre

函数的递归

class Solution:
    def reverseList(self, head: ListNode) -> ListNode:
        if head is None or head.next is None:
            return head
        p = self.reverseList(head.next)
        head.next.next = head
        head.next = None
        
        return p