将两个有序链表合并为一个新的有序链表并返回。新链表是通过拼接给定的两个链表的所有节点组成的。
示例:
输入:1->2->4, 1->3->4
输出:1->1->2->3->4->4
using System;
namespace MergeTwoLists
{
public class ListNode
{
public int val;
public ListNode next;
public ListNode(int x) { val = x; }
}
class Program
{
static void Main(string[] args)
{
}
public static ListNode MergeTwoLists(ListNode l1, ListNode l2)
{
if (l1 == null)
return l2;
if (l2 == null)
return l1;
ListNode newNode = null;
if (l1.val < l2.val)
{
newNode = l1;
newNode.next = MergeTwoLists(l1.next, l2);
}
else
{
newNode = l2;
newNode.next = MergeTwoLists(l1, l2.next);
}
return newNode;
}
}
}