Reverse Linked List

LeetCode題目: 206. Reverse Linked List

My solution:

/**
 *  
 * function ListNode(val, next) {
 *     this.val = (val===undefined ? 0 : val)
 *     this.next = (next===undefined ? null : next)
 * }
 */
/**
 * @param {ListNode} head
 * @return {ListNode}
 */
let reverseList = head => {
    let node = null;
    while(head !== null) {
        const temp = head.next;
        head.next = node;
        node = head;
        head = temp;
    }
    return node;    
}