题解 | #合并两个排序的链表#

/*
 * function ListNode(x){
 *   this.val = x;
 *   this.next = null;
 * }
 */
/**
 * 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可
 *
 * 
 * @param pHead1 ListNode类 
 * @param pHead2 ListNode类 
 * @return ListNode类
 */
function Merge( pHead1 ,  pHead2 ) {
    // write code here
    let p1 = pHead1
    let p2 = pHead2
    let p = new ListNode(0)
    let current = p
    while (p1&&p2) {
        if(p1.val <= p2.val) {
            current.next = p1
            p1 = p1.next
        }
        else {
            current.next = p2
            p2 = p2.next
        }
        current = current.next
    }
    if(p1) {
        current.next = p1
    }
    else {
        current.next = p2
    }
    return p.next
}
module.exports = {
    Merge : Merge
};