思路:
1.定义变量l存放链表的值,并将listNode赋值给head
2开始循环,将每个head.val用insert插入到列表l中第一个位置中,其余元素往后移。从而实现从尾部到头部
# -*- 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
l = []
head = listNode
while head:
l.insert(0, head.val)
head = head.next
return l
大佬的思路还是很精辟的,多学习学习