标签:bsp 尾到头 new val span init elf not def
# -*- 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]
标签:bsp 尾到头 new val span init elf not def
原文地址:http://www.cnblogs.com/llw1121/p/7613751.html