【LeetCode】merge-two-sorted-lists

merge-two-sorted-lists

时间限制：1秒 空间限制：32768K 热度指数：8819

本题知识点： 链表 leetcode

算法知识视频讲解

题目描述

 

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.

 

/**
 * 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 *p=new ListNode(0);
        ListNode *p1=p;
        while(l1&&l2){
           if(l1->val<l2->val){
               p->next=l1;l1=l1->next;p=p->next;
           } 
            else {p->next=l2;l2=l2->next;p=p->next;}
        }
        if(l1!=NULL)p->next=l1;
        if(l2!=NULL)p->next=l2;
        return p1->next;
    }
};