题解 | #反转链表#
反转链表
https://www.nowcoder.com/practice/75e878df47f24fdc9dc3e400ec6058ca
# class ListNode: # def __init__(self, x): # self.val = x # self.next = None # # 代码中的类名、方法名、参数名已经指定,请勿修改,直接返回方法规定的值即可 # # # @param head ListNode类 # @return ListNode类 # class Solution: def ReverseList(self , head: ListNode) -> ListNode: stack = [] tmp = head while tmp is not None: stack.append(tmp.val) tmp = tmp.next head = None while len(stack)>=1: if head is None: head = ListNode(stack.pop()) else: t = head while t.next is not None: t = t.next t.next = ListNode(stack.pop()) return head#反转链表#