题目描述

输入一个链表，反转链表后，输出新链表的表头

代码实现

/**
 * 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) {
    var prev = null;
    var cur = head;

    while(cur){
        var temp = cur.next;
        cur.next = prev;
        prev = cur;
        cur = temp;
    }

    return prev;
};