反转链表

# class ListNode:
#     def __init__(self, x):
#         self.val = x
#         self.next = None

class Solution:
    def reversePrint(self, head: ListNode) -> List[int]:
        stack = []
        p = head
        while p != None:
            stack.append(p.val)
            p = p.next
        return stack[::-1]

class Node():
    def __init__(self,data):
        self.data = data
        self.next = None

class List():
    def __init__(self):
        self._head = None

        # 尾插法插入元素
    def append(self, data):
        # 在单链表后插入元素，需要一个指针遍历到最后一个结点
        p = self._head
        n = Node(data)
        if self._head == None:
            self._head = n
        else:
            while p.next != None:
                p = p.next
            p.next = n
    def reverslist(self):
        pre = None
        cur = self._head

        while cur:
            temp = cur.next
            cur.next = pre
            pre = cur
            cur = temp
        p = pre
        while p != None:  # p.next != None
            print(p.data, end=' ')
            p = p.next

l1 = List()
data = int(input("请输入链表l1中的值，输入-1结束："))
while data!=-1:
    l1.append(data)
    data = int(input("请输入链表l1中的值，输入-1结束："))
l1.reverslist()