LeetCode - Reverse Linked List
// recursive (재귀 ver.)
var reverseList = function(head, prev=null) {
if(!head) return prev;
let temp = head.next
head.next = prev;
return reverseList(temp, head);
};
// iterative (반복문 ver.)
var reverseList = function(head) {
let node = head, reversed = null;
while(node){
let temp = node;
node=node.next;
temp.next = reversed;
reversed = temp;
}
return reversed;
};