题解 | BM1 反转链表

/*function ListNode(x){
    this.val = x;
    this.next = null;
}*/
function ReverseList(pHead) {
    // write code here
    let list = new ListNode(0);
    list.next = pHead;
    let pre = new ListNode(0);
    let ans = pre;
    function getNode(cur) {
        if (cur == null || cur.next == null) {
            return;
        }
        let val = cur.val;
        cur = cur.next;
        getNode(cur);
        pre.next = new ListNode(0);
        pre = pre.next;
        pre.val = cur.val;
        return;
    }
    getNode(list);
    return ans.next;
}
module.exports = {
    ReverseList: ReverseList,
};