leetcode-206 反转链表

/**
 * Definition for singly-linked list.
 * function ListNode(val, next) {
 *     this.val = (val===undefined ? 0 : val)
 *     this.next = (next===undefined ? null : next)
 * }
 */
/**
 * @param {ListNode} head
 * @return {ListNode}
 */
var reverseList = function (head) {
  let newHead = new ListNode();
  let cur = head;
  while (cur) {
    // 插入到newHead之后
    const next = cur.next; // 保存cur.next
    cur.next = newHead.next;
    newHead.next = cur;
    cur = next;
  }
  return newHead.next;
};