/**
* 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) {
// 定义两个指针,分别指向前一节点、当前节点、
let pre = null
let cur = head
while(cur !== null){
let next = cur.next
// 指向反转
cur.next = pre
// pre,cur,前移
pre = cur
cur = next
}
return pre
};
具体解题思路可参考:Leetcode 206:反转链表(最详细解决方案!!!)_coordinate_blog的博客-CSDN博客_leetcode206