leetcode原题:206.反转链表
反转形如
1->2->3->null
思路:采用函数调用栈的形式,保存每个链表,接着每两个进行一次反转
/**
* @param {ListNode} head
* @return {ListNode}
*/
var reverseList = function(head) {
if (head == null || head.next == null) return head;
let last = reverseList(head.next);
head.next.next = head;
head.next = null;
return last;
};