首页 > 代码库 > Leetcode: Merge Two Sorted Lists
Leetcode: 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.
代码：
class Solution {public: ListNode *mergeTwoLists(ListNode *l1, ListNode *l2) { if(l1 == NULL) return l2; if(l2 == NULL) return l1; ListNode *dummy = new ListNode(-1); dummy->next = NULL; for(ListNode *p = dummy; l1 || l2; p = p->next){ int l1v = l1?l1->val:INT_MAX; int l2v = l2?l2->val:INT_MAX; if(l1v <= l2v){ p->next = l1; l1 = l1->next; }else{ p->next = l2; l2 = l2->next; } } return dummy->next; }};
Leetcode: Merge Two Sorted Lists
声明：以上内容来自用户投稿及互联网公开渠道收集整理发布，本网站不拥有所有权，未作人工编辑处理，也不承担相关法律责任，若内容有误或涉及侵权可进行投诉： 投诉/举报 工作人员会在5个工作日内联系你，一经查实，本站将立刻删除涉嫌侵权内容。