题解 | 反转链表
反转链表
https://www.nowcoder.com/practice/75e878df47f24fdc9dc3e400ec6058ca
/*
* function ListNode(x){
* this.val = x;
* this.next = null;
* }
*/
/**
* 代码中的类名、方法名、参数名已经指定,请勿修改,直接返回方法规定的值即可
*
*
* @param head ListNode类
* @return ListNode类
*/
function ReverseList( head ) {
if (!head || (!head.val && head.val !== 0)) {
return null;
}
let cur = head, pre = null;
while (cur && (!!cur.val || cur.val === 0)) {
const next = cur.next;
cur.next = pre;
pre = cur;
cur = next;
}
return pre;
}
module.exports = {
ReverseList : ReverseList
};
好像这里对0不处理,也能正常通过。
查看20道真题和解析