21. Merge Two Sorted Lists

最新推荐文章于 2024-01-12 14:30:52 发布

笨笨De蜗牛

最新推荐文章于 2024-01-12 14:30:52 发布

阅读量229

点赞数

分类专栏： LEETCODE

本文链接：https://blog.csdn.net/a342500329a/article/details/50868016

版权

LEETCODE 专栏收录该内容

155 篇文章 0 订阅

订阅专栏

21. Merge Two Sorted Lists

My Submissions

Total Accepted: 114471 Total Submissions: 327808 Difficulty: Easy

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.

Subscribe to see which companies asked this question

public class Solution {
    public ListNode mergeTwoLists(ListNode l1, ListNode l2) {
        if(l1 == null) return l2;
        if(l2 == null) return l1;
        ListNode head=null;
        ListNode endd=null;
        while(l1!=null&&l2!=null)
        {
            if(l1.val<=l2.val)
            {
                 if(head==null)
                {
                    head=l1;
                    endd=head;
                }
                else
                {
                    endd.next=l1;
                    endd=endd.next;
                }
                l1=l1.next;
            }
            else
            {
                  if(head==null)
                 {
                     head=l2;
                     endd=head;
                 }
                 else
                {
                    endd.next=l2;
                    endd=endd.next;
                }
                l2=l2.next;
            }
        }
        if(l1!=null)
        {
            endd.next=l1;
        }
        if(l2!=null)
        {
            endd.next=l2;
        }
        return head;
    }
}

C++递归代码、

class Solution {
public:
    ListNode *mergeTwoLists(ListNode *l1, ListNode *l2) {
        if(l1 == NULL) return l2;
        if(l2 == NULL) return l1;

        if(l1->val < l2->val) {
            l1->next = mergeTwoLists(l1->next, l2);
        } else {
            l2->next = mergeTwoLists(l1,l2->next);
        }
    }
};