单链表 实现倒序
js 实现
/**
* Definition for singly-linked list.
* function ListNode(val) {
* this.val = val;
* this.next = null;
* }
*/
1:迭代
/**
* @param {ListNode} head
* @return {ListNode}
*/
var reverseList = function(head) {
var newHead = null;
while(head) {
let pointer = head.next;
head.next = newHead;
newHead = head;
head = pointer;
}
return newHead;
};
2:递归
var reverseList = function(head, newHead = null) {
if (head === null) {
return newHead;
}
let pointer = head.next;
head.next = newHead;
newHead = head;
head = pointer;
return reverseList(head, newHead);
};