24.反转链表
模版题
/**
* Definition for singly-linked list.
* function ListNode(val) {
* this.val = val;
* this.next = null;
* }
*/
/**
* @param {ListNode} head
* @return {ListNode}
*/
var reverseList = function(head) {
// 模版
if(!head || !head.next) return head
let prev = null
let curr = head
let temp = null
while(curr) {
let temp = curr.next
curr.next = prev
prev = curr
curr = temp
}
return prev
};