Merge Two Sorted Lists

最新推荐文章于 2020-08-26 10:35:53 发布

原创最新推荐文章于 2020-08-26 10:35:53 发布 · 642 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#Java #LeetCode #链表 #LinkedList

LeetCode 专栏收录该内容

150 篇文章

订阅专栏

本文介绍了一种将两个已排序的链表合并为一个新排序链表的方法。通过比较两个链表节点的值，按升序连接节点形成新链表。

摘要生成于 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.

方法

有序链表，合并成一个有序链表。

	   public ListNode mergeTwoLists(ListNode l1, ListNode l2) {
	        if (l1 == null) {
	            return l2;
	        }
	        if (l2 == null) {
	            return l1;
	        }
	        
	        ListNode head = null;
	        ListNode end = null;
	        ListNode first = l1;
	        ListNode second = l2;
	        while (first != null && second != null) {
	            int temp1 = first.val;
	            int temp2 = second.val;
	            if (temp1 <= temp2) {
	                if (head == null) {
	                    head = first; 
	                    end = head;
	                } else {
	                    end.next = first;
	                    end = first;
	                }
	                first = first.next;
	            } else {
	                if (head == null) {
	                    head = second; 
	                    end = head;
	                } else {
	                    end.next = second;
	                    end = second;
	                }
	                second = second.next;
	            }
	            
	        }
	        if (first != null) {
	            end.next = first;
	        }
	        if (second != null) {
	            end.next = second;
	        }
	        return head;
	    }