题目描述
解题思路
看这里:剑指 Offer 24. 反转链表(迭代 / 递归,清晰图解)_k神
代码实现
/**
* Definition for singly-linked list.
* function ListNode(val) {
* this.val = val;
* this.next = null;
* }
*/
/**
* @param {ListNode} head
* @return {ListNode}
*/
var reverseList = function(head) {
let [pre, cur] = [null, head];
while (cur) {
let temp = cur.next;
cur.next = pre;
pre = cur;
cur = temp;
}
return pre;
};