LeetCode 2. 两数相加
原题链接
中等
作者:
RiseAbove1
,
2022-11-30 22:46:45
,
所有人可见
,
阅读 130
/**
* 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) {
auto dummy = new ListNode(-1);//虚拟头节点
auto cur = dummy;
int t = 0;//进位
while(l1 || l2 || t){//从前往后加
if(l1) {
cout<<"l1:"<<l1->val<<endl;
t += l1->val,l1 = l1->next;
}
if(l2) {
cout<<"l2:"<<l2->val<<endl;
t += l2->val,l2 = l2->next;
}
cur = cur->next = new ListNode(t % 10);
t /= 10;
}
return dummy->next;
}
};