leetcode21
Merge Two Sorted Lists
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.
不是很难的一个题目,我使用了map容器,用节点值域做键,节点指针做值,先讲2个链表扔进map,根据键排序,然后遍历map容器,讲链表连起来。
/**
* 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 * temp, *t;
if (l1 == NULL && l2 == NULL)
return NULL;
if (l1 == NULL)
return l2;
if (l2 == NULL)
return l1;
multimap<int, ListNode*> mi;
while (l1)
{
mi.insert(make_pair(l1->val, l1));
l1 = l1->next;
}
while (l2)
{
mi.insert(make_pair(l2->val, l2));
l2 = l2->next;
}
t = temp = mi.begin()->second;
for (multimap<int, ListNode*>::iterator it = ++mi.begin(); it != mi.end(); ++it)
{
temp->next = it->second;
temp = temp->next;
}
temp->next = NULL;
return t;
}
};