题目描述:
输入两个递增排序的链表,合并这两个链表并使新链表中的结点仍然是按照递增排序的。
样例:
输入:1->3->5 , 2->4->5
输出:1->2->3->4->5->5
算法:
/**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* ListNode *next;
* ListNode(int x) : val(x), next(NULL) {}
* };
*/
class Solution {
public:
ListNode* merge(ListNode* l1, ListNode* l2) {
ListNode* head = new ListNode(0);
ListNode* index = head;
while(l1!=NULL && l2!=NULL)
{
if(l1->val <= l2->val)
{
index->next = l1;
l1 = l1->next;
}
else
{
index->next = l2;
l2 = l2->next;
}
index = index -> next;
}
if(l1)
{
index -> next = l1;
}
if(l2)
{
index -> next = l2;
}
return head->next;
}
};