剑指 Offer 25. 合并两个排序的链表
剑指 Offer 25. 合并两个排序的链表
输入两个递增排序的链表,合并这两个链表并使新链表中的节点仍然是递增排序的。
示例1:
输入:1->2->4, 1->3->4
输出:1->1->2->3->4->4
限制:
0 <= 链表长度 <= 1000
注意:本题与主站 21 题相同:https://leetcode-cn.com/problems/merge-two-sorted-lists/
通过次数238,638提交次数328,257
/**
* 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) {
ListNode dummy = new ListNode(-1);
ListNode head = dummy;
while(l1!=null&&l2!=null)
{
if(l1.val<l2.val)
{
dummy.next = l1;
l1 = l1.next;
}
else
{
dummy.next = l2;
l2 = l2.next;
}
dummy = dummy.next;
}
dummy.next = l1!=null?l1:l2; //
return head.next;
}
}