开始刷leetcode day10：Merge Two Sorted Lists

最新推荐文章于 2022-05-22 13:07:29 发布

原创最新推荐文章于 2022-05-22 13:07:29 发布 · 290 阅读

0 ·

CC 4.0 BY-SA版权

leetcode 专栏收录该内容

88 篇文章

订阅专栏

本文介绍了一种将两个已排序的链表合并成一个新排序链表的方法，并提供了一个Java实现示例。该方法通过比较两个链表节点的值来决定合并顺序。

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.

Java:

/**
* Definition for singly-linked list.
* public class ListNode {
* int val;
* ListNode next;
* ListNode(int x) { val = x; }
* }
*/
public class Solution {
public ListNode mergeTwoLists(ListNode l1, ListNode l2) {
if(l1 == null && l2 == null) return null;
if(l1 == null || l2 == null) return l1==null?l2:l1;
ListNode l3 = l1;
ListNode l4 = l2;
ListNode l6 = l3;
ListNode head = l3;
while(l3 != null && l4 != null)
{
if(l3.val <= l4.val)
{
l6 = l3;
l3 = l3.next;
}
else if(l4.val < l3.val && l3 == l1 && l4 == l2)
{
head = l4;
l6 = head;
l4 = l4.next;
head.next = l3;
}else
{
ListNode newNode = new ListNode(l3.val);
newNode.next = l3.next;
l3.val = l4.val;
l3.next = newNode;
l4 = l4.next;
l6 = l3;
l3 = l3.next;
}

}

ListNode l5 = l3 == null? l4:l3;
if(l5 != null)
{
l6.next = l5;
}

return head;
}
}