LeetCode 2. 两数相加
原题链接
中等
作者:
bbszcxhnk
,
2024-01-04 02:16:10
,
所有人可见
,
阅读 37
/**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* ListNode *next;
* ListNode() : val(0), next(nullptr) {}
* ListNode(int x) : val(x), next(nullptr) {}
* ListNode(int x, ListNode *next) : val(x), next(next) {}
* };
*/
class Solution {
public:
ListNode* addTwoNumbers(ListNode* l1, ListNode* l2) {
ListNode dummy(0);
ListNode* tail{&dummy};
int c = 0;
while (l1 || l2 || c) {
if (l1) c += l1->val, l1 = l1->next;
if (l2) c += l2->val, l2 = l2->next;
tail = tail->next = new ListNode(c % 10, nullptr);
c /= 10;
}
return dummy.next;
}
};