python 单链表逆置
def reverseNode(node):
p = node
cur = node.next
while cur:
tmp = cur.next
cur.next = p
p = cur
cur = tmp
空间复杂度O(1),时间复杂度O(n)
def reverseNode(node):
p = node
cur = node.next
while cur:
tmp = cur.next
cur.next = p
p = cur
cur = tmp
空间复杂度O(1),时间复杂度O(n)