/**
* 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* result = new ListNode(0);
ListNode* head = result;
while(l1 != nullptr || l2 != nullptr){
int num = head->val;
if(l1 != nullptr && l2 != nullptr){
num += l1->val + l2->val;
l1 = l1->next;
l2 = l2->next;
}else if(l1 != nullptr){
num += l1->val;
l1 = l1->next;
}else if(l2 != nullptr){
num += l2->val;
l2 = l2->next;
}
if(num / 10 > 0){
head->val = num % 10;
ListNode* newNode = new ListNode(1);
head->next = newNode;
}else if(l1 != nullptr || l2 != nullptr){
head->val = num;
ListNode* newNode = new ListNode(0);
head->next = newNode;
}else{
head->val = num;
}
head = head->next;
}
return result;
}
};
11-21
1107
03-07
3183
07-14
459
“相关推荐”对你有帮助么?
-
非常没帮助
-
没帮助
-
一般
-
有帮助
-
非常有帮助
提交