文章目录
- AcWing 36. 合并两个排序的链表
- AC代码
AcWing 36. 合并两个排序的链表
本题链接:AcWing 36. 合并两个排序的链表
本博客给出本题截图:
AC代码
代码:
/** * 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 *dummy = new ListNode(0); ListNode *cur = dummy; while (l1 != NULL && l2 != NULL) { if (l1 -> val < l2 -> val) { cur -> next = l1; l1 = l1 -> next; } else { cur -> next = l2; l2 = l2 -> next; } cur = cur -> next; } cur -> next = (l1 != NULL ? l1 : l2); return dummy -> next; } };