Add Two Numbers

You are given two non-empty linked lists representing two non-negative integers. 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.

You may assume the two numbers do not contain any leading zero, except the number 0 itself.

Input: (2 -> 4 -> 3) + (5 -> 6 -> 4)
Output: 7 -> 0 -> 8

/**
 * 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) {
        int  carry_bit = 0;
ListNode* result_node= NULL;
ListNode* previous_node = NULL;
int sum = 0;
int head = 0;
        while(l1 && l2){
sum = l1->val + l2->val + carry_bit;
ListNode* temp_node = (ListNode*) malloc(sizeof(ListNode));
if(sum > 9){
carry_bit = 1;
sum = sum % 10;
}else{
carry_bit = 0;
}
temp_node->val = sum;
temp_node->next = NULL;
if(previous_node)
previous_node->next = temp_node;

if(head == 0){
result_node = temp_node;
previous_node = temp_node;
head = 1;
}else{
previous_node = temp_node;
}
l1 = l1->next;
l2 = l2->next;
}


while(!l1 && l2){
sum =l2->val + carry_bit;
ListNode* temp_node = (ListNode*) malloc(sizeof(ListNode));
if(sum > 9){
carry_bit = 1;
sum = sum % 10;
}else{
carry_bit = 0;
}
temp_node->val = sum;
temp_node->next = NULL;
if(previous_node)
previous_node->next = temp_node;

if(head == 0){
result_node = temp_node;
previous_node = temp_node;
head = 1;
}else{
previous_node = temp_node;
}
l2 = l2->next;
}






while(l1 && !l2){
sum =l1->val + carry_bit;
ListNode* temp_node = (ListNode*) malloc(sizeof(ListNode));
if(sum > 9){
carry_bit = 1;
sum = sum % 10;
}else{
carry_bit = 0;
}
temp_node->val = sum;
temp_node->next = NULL;
if(previous_node)
previous_node->next = temp_node;

if(head == 0){
result_node = temp_node;
previous_node = temp_node;
head = 1;
}else{
previous_node = temp_node;
}
l1 = l1->next;
}


if(carry_bit){
ListNode* temp_node = (ListNode*) malloc(sizeof(ListNode));
temp_node->val = carry_bit;
temp_node->next = NULL;
carry_bit = 0;
previous_node->next = temp_node;

}






return result_node;
    }
};