/**
* 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 *ret = new ListNode(0);
ListNode *cur = ret;
int sum = 0;
while(1){
if(l1 != NULL) {
sum += l1->val;
l1 = l1->next;
}
if(l2 != NULL) {
sum += l2->val;
l2 = l2->next;
}
cur->val = sum % 10; //当前这个节点值
sum /= 10;
if(l1 != NULL || l2 != NULL || sum) cur = (cur->next = new ListNode(0)); //构造下一个节点
else break;
}
return ret;
}
};
leetcode+2. Add Two Numbers+链表
最新推荐文章于 2024-06-30 05:58:55 发布