从尾到头打印链表

最新推荐文章于 2024-02-14 20:22:16 发布

Yif_Zhou

最新推荐文章于 2024-02-14 20:22:16 发布

阅读量72

点赞数

分类专栏：剑指offer 文章标签：单链表

本文链接：https://blog.csdn.net/weixin_40733475/article/details/104271955

版权

剑指offer 专栏收录该内容

5 篇文章 0 订阅

订阅专栏

class Solution:
    def reversePrint(self, head: ListNode) -> List[int]:
        if not head:
            return []
        root = self.reverseLink(head)
        cur = root
        res = [] 
        while cur:
            res.append(cur.val)
            cur = cur.next 
        self.reverseLink(root)
        return res 
    def reverseLink(self, head: ListNode) :
        dy = None 
        cur, tmp = head, head 
        while cur:
            tmp = cur.next 
            cur.next = dy
            dy, cur = cur, tmp
        return dy

https://leetcode-cn.com/problems/cong-wei-dao-tou-da-yin-lian-biao-lcof/