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

public class Solution {

    ListNode Merge(ListNode  pHead1, ListNode pHead2 ) {
        if (pHead1 == null) {
            return pHead2;
        } else if (pHead2 == null) {
            return pHead1;
        }

        ListNode res = new ListNode(-1);
        ListNode cur = res;

        while (pHead1 != null && pHead2 != null) {
            if (pHead1.val <= pHead2.val) {
                cur.next = pHead1   ;
                pHead1 = pHead1.next;;
            } else {
                cur.next = pHead2;
                pHead2 = pHead2.next;

            }
            cur = cur.next;
        }

        if (pHead1 != null) cur.next = pHead1;
        if (pHead2 != null) cur.next = pHead2;

        return res.next;
    }
}