# -*- coding:utf-8 -*-
# class ListNode:
# def __init__(self, x):
# self.val = x
# self.next = None
class Solution:
# 返回从尾部到头部的列表值序列,例如[1,2,3]
def printListFromTailToHead(self, listNode):
# write code here
if not listNode:
return []
Arraylist = []
while listNode:
Arraylist.append(listNode.val)
listNode = listNode.next
Arraylist.reverse()
return Arraylist
剑指offer 之从尾到头打印链表
最新推荐文章于 2024-07-25 11:27:31 发布