Leetcode-Merge Two Sorted Lists

最新推荐文章于 2022-02-11 00:03:48 发布

原创最新推荐文章于 2022-02-11 00:03:48 发布 · 432 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#leetcode #Merge Two Sorted Lis

leetcode 专栏收录该内容

32 篇文章

订阅专栏

本文介绍了如何使用Java合并两个已排序的链表，并通过示例代码展示了实现过程。合并后的链表将由原始链表中的节点构成。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Merge two sorted linked lists and return it as a new list. The new list should be made by splicing together the nodes of the first two lists.

AC代码：

public class Solution {
    public ListNode mergeTwoLists(ListNode l1, ListNode l2) {
        if( l1 == null && l2 == null ) return null;
		if( l1 == null ) return l2;
		if( l2 == null ) return l1;
		ListNode p = l1;
		ListNode q = l2;
		ListNode dummyHead = new ListNode(-1);
		ListNode dummyCurr = dummyHead;
		while( p != null && q != null ){
			if( p.val <= q.val){
				dummyCurr.next = p;
				p = p.next;
				dummyCurr = dummyCurr.next;
			}else{
				dummyCurr.next = q;
				q = q.next;
				dummyCurr = dummyCurr.next;
			}
		}
		if( p == null ) dummyCurr.next = q;
		if( q == null ) dummyCurr.next = p;
		return dummyHead.next;
    }
}