輸入兩個(gè)遞增排序的鏈表，合并這兩個(gè)鏈表并使新鏈表中的節(jié)點(diǎn)仍然是遞增排序的。

示例1：

輸入：1->2->4, 1->3->4
輸出：1->1->2->3->4->4
限制：

0 <= 鏈表長(zhǎng)度 <= 1000

代碼：

/**

?*?Definition?for?singly-linked?list.

?*?public?class?ListNode?{

?*?????int?val;

?*?????ListNode?next;

?*?????ListNode(int?x)?{?val?=?x;?}

?*?}

?*/

class?Solution?{

????public?ListNode?mergeTwoLists(ListNode?l1,?ListNode?l2)?{

????????if(l1==null)

????????{

????????????return?l2;

????????}

????????if(l2==null)

????????{

????????????return?l1;

????????}

????????ListNode?head?=?new?ListNode(0);

????????ListNode?result?=?head;

????????while(l1!=null&&l2!=null)

????????{

????????????if(l1.val<=l2.val)

????????????{

????????????????result.val?=?l1.val;

????????????????l1?=?l1.next;

????????????}

????????????else

????????????{

????????????????result.val?=?l2.val;

????????????????l2?=?l2.next;

????????????}

????????????ListNode?p?=?new?ListNode(0);

????????????result.next?=?p;

????????????result?=?p;

????????}

????????if(l1!=null)

????????{

????????????result.val?=?l1.val;

????????????result.next?=?l1.next;

????????}

?????????if(l2!=null)

????????{

????????????result.val?=?l2.val;

????????????result.next?=?l2.next;

????????}

????????return?head;

????}

}

總結(jié)

以上是生活随笔為你收集整理的【剑指offer】面试题25：合并两个排序的链表（Java）的全部?jī)?nèi)容，希望文章能夠幫你解決所遇到的問(wèn)題。

如果覺(jué)得生活随笔網(wǎng)站內(nèi)容還不錯(cuò)，歡迎將生活随笔推薦給好友。