遍历

遍历链表，再对数组进行逆序处理

#     def __init__(self, x):
#         self.val = x
#         self.next = None
#
# @param listNode ListNode类 
# @return int整型一维数组
#
class Solution:
    def printListFromTailToHead(self , listNode: ListNode) -> List[int]:
        # 遍历链表
        array = []
        while listNode:
            array.append(listNode.val)
            listNode = listNode.next
        # 数组逆序
        for i in range(int(len(array)/2)):
            temp = array[i]
            array[i] = array[-(i+1)]
            array[-(i+1)] = temp
        return array