我的脑瘫解法:
class Solution {
public:
ListNode* addTwoNumbers(ListNode* l1, ListNode* l2) {
if(l1 == nullptr && l2 == nullptr) return nullptr;
ListNode * res = new ListNode();
ListNode * head = res ;
int carry = 0, tmp = 0;
while(l1 != nullptr || l2 != nullptr) {
if(l1 != nullptr && l2 != nullptr) tmp = l1->val + l2->val + carry;
if(l1 != nullptr && l2 == nullptr) tmp = l1->val + carry;
if(l1 == nullptr && l2 != nullptr) tmp = l2->val + carry;
res->val = tmp%10;
carry = tmp/10;
if(l1 != nullptr ) l1 = l1->next;
if(l2 != nullptr ) l2 = l2->next;
if(l1 != nullptr || l2 != nullptr) {
ListNode *newNode = new ListNode();
res->next = newNode;
res = res->next;
}
}
if(carry > 0) {
ListNode * newNode = new ListNode(1) ;
res->next = newNode ;
}
return head;
}
};
官方题解:
class Solution {
public ListNode addTwoNumbers(ListNode l1, ListNode l2) {
ListNode head = null, tail = null;
int carry = 0;
while (l1 != null || l2 != null) {
int n1 = l1 != null ? l1.val : 0;
int n2 = l2 != null ? l2.val : 0;
int sum = n1 + n2 + carry;
if (head == null) {
head = tail = new ListNode(sum % 10);
} else {
tail.next = new ListNode(sum % 10);
tail = tail.next;
}
carry = sum / 10;
if (l1 != null) {
l1 = l1.next;
}
if (l2 != null) {
l2 = l2.next;
}
}
if (carry > 0) {
tail.next = new ListNode(carry);
}
return head;
}
}
作者:LeetCode-Solution
链接:https://leetcode-cn.com/problems/add-two-numbers/solution/liang-shu-xiang-jia-by-leetcode-solution/
来源:力扣(LeetCode)
著作权归作者所有。商业转载请联系作者获得授权,非商业转载请注明出处。