题链接:https://leetcode-cn.com/problems/fan-zhuan-lian-biao-lcof/
快慢指针遍历即可。
/**
* Definition for singly-linked list.
* function ListNode(val) {
* this.val = val;
* this.next = null;
* }
*/
/**
* @param {ListNode} head
* @return {ListNode}
*/
var reverseList = function(head) {
let res = null;
let temp = new ListNode();
let curNode = head;
while(curNode != null) {
temp = curNode.next;
curNode.next = res;
res = curNode;
curNode = temp;
}
return res;
};
O(n)的时间复杂度和O(1)的空间复杂度