您的位置:首页 > 其它

leetcode --21. Merge Two Sorted Lists

2017-07-24 14:46 393 查看
题目:https://leetcode.com/problems/merge-two-sorted-lists/#/description

代码:class Solution {
public:
ListNode* mergeTwoLists(ListNode* l1, ListNode* l2) {
ListNode *dummy = new ListNode(-1), *t = dummy;
while(l1&&l2){
if(l1->val < l2->val){
t->next = l1;
l1 = l1->next;
}else{
t->next = l2;
l2 = l2->next;
}
t = t->next;
}
t->next = l1?l1:l2;
return dummy->next;
}
};
内容来自用户分享和网络整理,不保证内容的准确性,如有侵权内容,可联系管理员处理 点击这里给我发消息
标签: