Top101-BM1-反转链表-(Leetcode 206) -(JavaScript实现)

BM1 反转链表

/**
 * Definition for singly-linked list.
 * function ListNode(val, next) {
 *     this.val = (val===undefined ? 0 : val)
 *     this.next = (next===undefined ? null : next)
 * }
 */
/**
 * @param {ListNode} head
 * @return {ListNode}
 */
var reverseList = function (head) {
    let p1 = head, p2 = null;
    while(p1) {
        const tmp = p1.next;
        p1.next = p2
        p2 = p1
        p1 = tmp
    }
    return p2
};

时间复杂度：O(n)

空间复杂度：O(1)