将链表读取到列表中,然后反转列表
class Solution:
def reversePrint(self, head: ListNode) -> List[int]:
ans=[]
while(head):
ans.append(head.val)
head = head.next
return ans[::-1]
将链表读取到列表中,然后反转列表
class Solution:
def reversePrint(self, head: ListNode) -> List[int]:
ans=[]
while(head):
ans.append(head.val)
head = head.next
return ans[::-1]