/**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* ListNode *next;
* ListNode(int x) : val(x), next(NULL) {}
* };
*/
class Solution {
public:
ListNode* addTwoNumbers(ListNode* l1, ListNode* l2) {
if (l1 == nullptr) return l2;
if (l2 == nullptr) return l1;
int temp = 0;
ListNode* ans = l1;
while (l1 != nullptr) {
l1->val = (l2 == nullptr? l1->val + temp : l1->val + l2->val + temp);
temp = l1->val / 10;
l1->val %= 10;
if (l1 != nullptr && l2 != nullptr && l1->next == nullptr && l2->next != nullptr) {
l1->next = l2->next;
l2->next = nullptr;
}
if (l1->next == nullptr && temp != 0) {
l1->next = new ListNode(temp);
temp = 0;
}
l1 = l1->next;
if (l2 != nullptr) {
l2 = l2->next;
}
}
return ans;
}
};
leetcode
最新推荐文章于 2024-08-10 16:13:14 发布