You are given two linked lists representing two non-negative numbers. The digits are stored in reverse order and each of their nodes contain a single digit. Add the two numbers and return it as a linked list.
Input: (2 -> 4 -> 3) + (5 -> 6 -> 4)
Output: 7 -> 0 -> 8
ListNode *addTwoNumbers(ListNode *l1, ListNode *l2) {
int carry = 0, sum = 0;
ListNode* head = NULL;
ListNode* tail = NULL;
while (l1 != NULL || l2 != NULL || carry != 0){
int num_l1 = l1 ? l1->val : 0;
int num_l2 = l2 ? l2->val : 0;
sum = num_l1 + num_l2 + carry;
carry = sum / 10;
sum %= 10;
ListNode* newNode = new ListNode(sum);
if (head == NULL){
head = newNode;
tail = head;
}else{
tail->next = newNode;
tail = tail->next;
}
l1 = l1 ? l1->next : NULL;
l2 = l2 ? l2->next : NULL;
}
return head;
}