varreverseList=function(head){let pre =null;let curr = head ;let next = head ;while( curr !=null){
next = curr.next ;
curr.next = pre ;
pre = curr ;
curr = next ;}return pre ;};
leetcode 206. 反转链表问题描述代码问题描述反转一个单链表。示例:输入: 1->2->3->4->5->NULL输出: 5->4->3->2->1->NULL代码var reverseList = function(head) { let pre = null ; let curr = head ; let next = head ; while( curr != null ){