解法一:
/*function ListNode(x){
this.val = x;
this.next = null;
}*/
function ReverseList(pHead)
{
let temp = null
let newcurr = null
while(pHead){
newcurr = pHead
pHead = pHead.next
//这一步必须在下一步之前,因为上一步赋值的时候是把地址赋过来了,
//如果先让newcurr的next指针发生改变,那么原本的pHead的next也会被改变,
//所以先让curr指向下一个节点
newcurr.next = temp
temp = newcurr
}
return newcurr
}
module.exports = {
ReverseList : ReverseList
};
运行时间:81ms
占用内存:8328KB