首页 > 代码库 > [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.
注意写出鲁棒性的代码，时间复杂度O(n),空间复杂度O(1)
/** * 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; ListNode *head = NULL; ListNode **p = &head; while (l1 && l2) { if(l1->val < l2->val) { *p = l1; p = &(l1->next); l1 = l1->next; } else { *p = l2; p = &(l2->next); l2 = l2->next; } } if (l1 != NULL) { *p = l1; } else { *p = l2; } return head; }};
[LeetCode] Merge Two Sorted Lists
声明：以上内容来自用户投稿及互联网公开渠道收集整理发布，本网站不拥有所有权，未作人工编辑处理，也不承担相关法律责任，若内容有误或涉及侵权可进行投诉： 投诉/举报 工作人员会在5个工作日内联系你，一经查实，本站将立刻删除涉嫌侵权内容。