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

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

}
module.exports = {
    Merge : Merge
};