关闭

LeetCode: Merge Two Sorted Lists

标签: leetcodelistMerge Two Sorted Lis
55人阅读 评论(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.


源代码:

/**
 * 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) {
    if (l1 == NULL) return l2;
    if (l2 == NULL) return l1;
    
    struct ListNode* head = new ListNode(0);
    struct ListNode* tmp = head;
    while(l1 != NULL && l2 != NULL){

        if (l1->val > l2->val) {
            tmp->next = l2;
            l2 = l2->next;
        }
        else {
            tmp->next = l1;
            l1 = l1->next;
        }
        tmp = tmp->next;        
    }
    if (l1 != NULL) tmp->next = l1;
    if (l2 != NULL) tmp->next = l2;
    
    return head->next;
        
    }
};


1
0

查看评论
* 以上用户言论只代表其个人观点,不代表CSDN网站的观点或立场
    个人资料
    • 访问:4727次
    • 积分:823
    • 等级:
    • 排名:千里之外
    • 原创:73篇
    • 转载:8篇
    • 译文:0篇
    • 评论:0条