[leetcode-21-Merge Two Sorted Lists]

╰+哭是因爲堅強的太久メ 2022-01-06 11:17 286阅读 0赞

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.

思路:

由于链表是有序的,那么仅需要从两个链表的头开始比较即可。较小者插入新链表,然后向后依次比较。

  1. ListNode* mergeTwoLists(ListNode* l1, ListNode* l2)
  2. {
  3. ListNode* dummy = new ListNode(0);
  4. ListNode* p = dummy ;
  5. while (l1 != NULL && l2 != NULL)
  6. {
  7. if (l1->val < l2->val)
  8. {
  9. p->next = l1;
  10. l1 = l1->next;
  11. }
  12. else
  13. {
  14. p->next = l2;
  15. l2 = l2->next;
  16. }
  17. p = p->next;
  18. }
  19. if (l1 != NULL)p->next = l1;
  20. if (l2 != NULL)p->next = l2;
  21. return dummy->next;
  22. }

转载于:https://www.cnblogs.com/hellowooorld/p/6629353.html

发表评论

表情:
评论列表 (有 0 条评论,286人围观)

还没有评论,来说两句吧...

相关阅读