Reverse a singly-linked list iteratively.
Examples
L = null, return null
L = 1 -> null, return 1 -> null
L = 1 -> 2 -> 3 -> null, return 3 -> 2 -> 1 -> null
class Solution(object):
def reverse(self, head):
if not head:
return None
p = head
q = head.next
while q:
head.next = q.next
q.next = p
p = q
q = head.next
return p
Reverse a Linked List iterative way recursive way
to do 5%.. Reverse Linked List simple iterative - JS simp...
Reverse a singly-linked list iteratively. Examples L = nu...
Reverse a singly linked list. 这道题有Recursive和Iterative两种解法...
**206. Reverse Linked List **Reverse a singly linked list...
问题：Reverse Linked List Reverse a singly linked list. Inpu...
206. Reverse Linked List Reverse a singly linked list. Hi...
92. Reverse Linked List II Reverse a linked list from pos...
题目206. Reverse Linked List Reverse a singly linked list.c...
206. Reverse Linked List Reverse a singly linked list. Ex...
本文标题：Reverse Linked List (iterative)
本文链接：https://www.haomeiwen.com/subject/zrfadqtx.html
网友评论