题解 | 合并两个排序的链表
合并两个排序的链表
https://www.nowcoder.com/practice/d8b6b4358f774294a89de2a6ac4d9337
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) { if (pHead1 == null) { return pHead2; } if (pHead2 == null) { return pHead1; } ListNode result = null; if (pHead1.val <= pHead2.val) { result = pHead1; pHead1 = pHead1.next; } else { result = pHead2; pHead2 = pHead2.next; } ListNode temp3 = result; while (pHead1 != null && pHead2 != null) { if (pHead1.val <= pHead2.val) { temp3.next = pHead1; temp3 = pHead1; pHead1 = pHead1.next; } else { temp3.next = pHead2; temp3 = pHead2; pHead2 = pHead2.next; } } // 任意一个ListNode为空,可以把另外一个不为空的追加的最新的队列中 if (pHead1 == null) { temp3.next = pHead2; } else { temp3.next = pHead1; } return result; } }