目录结构
1.题目
输入两个递增排序的链表,合并这两个链表并使新链表中的节点仍然是递增排序的。
示例:
输入:1->2->4, 1->3->4
输出:1->1->2->3->4->4
限制:
0 <= 链表长度 <= 1000
来源:力扣(LeetCode)
链接:https://leetcode-cn.com/problems/he-bing-liang-ge-pai-xu-de-lian-biao-lcof
著作权归领扣网络所有。商业转载请联系官方授权,非商业转载请注明出处。
2.题解
public class Offer25 {
@Test
public void test() {
ListNode l1 = new ListNode(1, new ListNode(4, new ListNode(7, new ListNode(9, null))));
ListNode l2 = new ListNode(3, new ListNode(3, new ListNode(4, new ListNode(9, null))));
ListNode.printf(mergeTwoLists(l1, l2));
}
public ListNode mergeTwoLists(ListNode l1, ListNode l2) {
ListNode result = new ListNode(0), p;
p = result;
while (l1 != null && l2 != null) {
if (l1.val <= l2.val) {
p.next = l1;
l1 = l1.next;
} else {
p.next = l2;
l2 = l2.next;
}
p = p.next;
}
p.next = l1 == null ? l2 : l1;
return result.next;
}
}
- 时间复杂度:
- 空间复杂度: