LeetCode #21 Merge Two Sorted Lists C# Solution_c# mergetwolists-优快云博客

本文介绍了一种将两个已排序的链表合并为一个新排序链表的方法，并提供了一个C#实现示例。通过比较两个链表节点的值来决定新链表中下一个节点的选择，实现了链表的有效合并。

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

一道简单的链表题，然而我用了太久list<>已经忘记链表怎么做了= =
总而言之非常感谢http://www.cnblogs.com/etcow/archive/2012/09/29/2707908.html这篇文章……让我捡起来好久不用的东西= =

C# Code
    public class Solution
    {
        public ListNode MergeTwoLists(ListNode l1, ListNode l2)
        {
            if (l1 == null) return l2;
            if (l2 == null) return l1;
            ListNode resultList;
            ListNode currentNode;
            if (l1.val <= l2.val) { resultList = l1; l1 = l1.next; }
            else { resultList = l2; l2 = l2.next; }
            currentNode = resultList;

            while (l1 != null || l2 != null)
            {
                if (l1 == null)
                {
                    currentNode.next = l2; l2 = l2.next; currentNode = currentNode.next;
                    continue;
                }
                if (l2 == null)
                {
                    currentNode.next = l1; l1 = l1.next; currentNode = currentNode.next;
                    continue;
                }
                if (l1.val <= l2.val)
                {
                    currentNode.next = l1; l1 = l1.next; currentNode = currentNode.next;
                    continue;
                }
                else
                {
                    currentNode.next = l2; l2 = l2.next; currentNode = currentNode.next;
                    continue;
                }
            }
            return resultList;
        }
    }

这里写图片描述