题目链接:https://leetcode-cn.com/problems/reverse-linked-list/
/**
* 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 h = new ListNode();
while(head !== null){
let p = head;
head = head.next;
p.next = h.next;
h.next = p;
}
return h.next;
};