/**
* 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) {
// Start typing your C/C++ solution below
// DO NOT write int main() function
if (!l1) return l2;
if (!l2) return l1;
int sum = l1->val + l2->val;
ListNode *head = new ListNode(sum % 10);
ListNode *curr = head;
int carry = sum / 10;
l1 = l1->next;
l2 = l2->next;
while (l1 && l2) {
int sum = l1->val + l2->val + carry;
carry = sum / 10;
curr->next = new ListNode(sum % 10);
curr = curr->next;
l1 = l1->next;
l2 = l2->next;
}
while (l1) {
int sum = l1->val + carry;
carry = sum / 10;
curr->next = new ListNode(sum % 10);
curr = curr->next;
l1 = l1->next;
}
while (l2) {
int sum = l2->val + carry;
carry = sum / 10;
curr->next = new ListNode(sum % 10);
curr = curr->next;
l2 = l2->next;
}
if (carry) {
curr->next = new ListNode(carry);
}
return head;
}
};
Small Case: 12ms
Large Case: 204ms
Time: O(n)
Space: O(n)