题目链接

    遍历链表,将每个节点的next指向新链表的头,然后该节点成为新链表头

    1. let reverseList = function(head) {
    3.   // 遍历链表,将每个节点的next指向新链表的头,然后该节点成为新链表头
    4.   let newListHead = null;
    5.   while (head != null) {
    6.     let tmp = head.next;
    7.     head.next = newListHead;
    8.     newListHead = head;
    9.     head = tmp;
    10.   }
    11.   return newListHead;
    12. };