*ListNode
iteratively
# Definition for singly-linked list.
# class ListNode:
# def __init__(self, x):
# self.val = x
# self.next = None
class Solution:
def reverseList(self, head: ListNode) -> ListNode:
orginalListNode = head
reversedListNode = ListNode(0)
while orginalListNode:
temp = ListNode(orginalListNode.val)
temp.next = reversedListNode.next
reversedListNode.next = temp
orginalListNode = orginalListNode.next
return reversedListNode.next
这个就类似于3个套环123顺序套到另一根杆子上。
通过 | 72 ms | 15.8 MB | Python3 |
执行用时 :72 ms, 在所有 Python3 提交中击败了23.50%的用户
内存消耗 :15.8 MB, 在所有 Python3 提交中击败了14.51%的用户