Reverse a singly linked list.
这道题有Recursive和Iterative两种解法，这里先写Recursive的
需要好好思考一下。
public ListNode reverse(ListNode head) {
// write your code here
ListNode prev = null;
ListNode curr = head;
while (curr != null) {
ListNode currnext = curr.next;
curr.next = prev;
prev = curr;
curr = currnext;
}
return prev;
}
**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...
206.Reverse Linked List Reverse a singly linked list. 简单题...
Reverse a singly linked list. 这道题有Recursive和Iterative两种解法...
题目92. Reverse Linked List II Reverse a linked list from p...
链表逆序 206. Reverse Linked List 92. Reverse Linked List II ...
本文标题：35. Reverse Linked List
本文链接：https://www.haomeiwen.com/subject/dlybyttx.html
网友评论