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

import java.util.*;

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

public class Solution {
    /**
     * 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可
     *
     * 
     * @param pHead1 ListNode类 
     * @param pHead2 ListNode类 
     * @return ListNode类
     */
    public ListNode Merge (ListNode pHead1, ListNode pHead2) {
        // write code here
        ListNode dummy=new ListNode(0);
        ListNode head=dummy;
        while(pHead1!=null&&pHead2!=null){
            if(pHead1.val<pHead2.val){//当phead1的值小于PHead2的值
                dummy.next=pHead1;
                pHead1=pHead1.next;
            }else{//当pHead1的值大于等于pHead2的值
                dummy.next=pHead2;
                pHead2=pHead2.next;
            }
            dummy=dummy.next;
        }
        if(pHead1==null){
            dummy.next=pHead2;
        }else{
            dummy.next=pHead1;
        }
        return head.next;
    }
}