2153_reversePrint.py

# Definition for singly-linked list.
# class ListNode(object):
#     def __init__(self, x):
#         self.val = x
#         self.next = None

class Solution(object):
    def reversePrint(self, head):
        """
        :type head: ListNode
        :rtype: List[int]
        """
        result=[]
        p=head
        while(p!=None):
            result.insert(0,p.val)
            p=p.next
        return result