Merge Two Sorted Lists

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

xw_njust_ecjtu

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

阅读量705

点赞数

分类专栏： c++/c

本文链接：https://blog.csdn.net/njust_ecjtu/article/details/17421135

版权

c++/c 专栏收录该内容

93 篇文章 0 订阅

订阅专栏

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.

Sort List里面也有实现。

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode(int x) : val(x), next(NULL) {}
 * };
 */
class Solution {
public:
    ListNode *mergeTwoLists(ListNode *l1, ListNode *l2) {
       
       ListNode newlist(0);
       ListNode *plist;
       plist = &newlist;
       
       while(l1 != NULL && l2 != NULL)
       {
           if(l1->val <= l2->val)
           {
               plist->next = l1;
               plist = plist->next;
               l1 = l1->next ;
           }
           else
           {
               plist->next = l2;
               plist = plist->next;
               l2 = l2->next ;
           }
           
       }
       
       if(l1 != NULL )
       {
          plist->next = l1;
       }
       else if(l2 != NULL)
       {
           plist->next = l2;
       }
       
       return newlist.next;
    }
};