Print linked list in reverse order

1. Recursion

class Solution:
    # 返回从尾部到头部的列表值序列，例如[1,2,3]
    def printListFromTailToHead(self, listNode):
        # write code here
        if listNode:
            return self.printListFromTailToHead(listNode.next)+[listNode.val]
        else:
            return []

2. Stack

class Solution:
    # 返回从尾部到头部的列表值序列，例如[1,2,3]
    def printListFromTailToHead(self, listNode):
        stack = []
        res = []
        while listNode:
            stack.append(listNode)
            listNode = listNode.next
        while stack:
            res.append(stack.pop().val)
        return res