异名解题：反转链表

/**
 * @param {ListNode} head
 * @return {ListNode}
 */
function reverseList(head) {
    if (!head) return head;
    let list = [],tempNode = null, curNode = head;
    while (curNode) {
        tempNode = curNode.next || null
        curNode.next = list[list.length - 1] || null
        list.push(curNode);
        curNode = tempNode
    }
    return list[list.length-1]
};

/**
 * @param {ListNode} head
 * @return {ListNode}
 */
function reverseList(head) {
    let prev = null;
    let cur = head;
    let temp;
    while (cur) {
        temp = cur.next;
        cur.next = prev;
        prev = cur;
        cur = temp;
    }
    return prev;
};

function reverseList(head) {
    if (!head || !head.next) return head;
    let nextLoopStartNode = reverseList(head.next);

    // 原本关系：headPrev = null, headNext = head.next
    // 反转操作：head.next = null, headNext.next = head
    head.next.next = head;
    head.next = null;

    return nextLoopStartNode;
}