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

import java.util.*;

/*
 * public class ListNode {
 *   int val;
 *   ListNode next = null;
 *   public ListNode(int val) {
 *     this.val = val;
 *   }
 * }
 */

public class Solution {
    public ListNode Merge (ListNode pHead1, ListNode pHead2) {
       ListNode head = new ListNode(0);
       ListNode cur = head;
       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;
       }
       else{
        cur.next = pHead2;
       }
       return head.next;
    }
}