# -*- coding:utf-8 -*-
# class ListNode:
# def __init__(self, x):
# self.val = x
# self.next = None
class Solution:
# 返回从尾部到头部的列表值序列,例如[1,2,3]
def printListFromTailToHead(self, listNode):
newlist =[]
while listNode is not None:
newlist.append(listNode.val)
listNode = listNode.next
return newlist[::-1]
从尾到头打印链表-Python
猜你喜欢
转载自blog.csdn.net/qq_42707449/article/details/81099118
今日推荐
周排行