每天一道python练习10

题目:输入一个链表,从尾到头打印链表每个节点的值。


思路:append函数移动,reserve函数调序

code:

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
# -*- 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
Arr=[]
Head=listNode
while head:
Arr.append(head.val)
head=head.next
Arr.reverse()
return Arr