Add Two Numbers

Description
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.

Example
Input: (2 -> 4 -> 3) + (5 -> 6 -> 4)
Output: 7 -> 0 -> 8
Explanation: 342 + 465 = 807.

My Solution

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     struct ListNode *next;
 * };
 */
struct ListNode* addTwoNumbers(struct ListNode* l1, struct ListNode* l2) {
    struct ListNode* newList=(struct ListNode*)malloc(sizeof(struct ListNode));
    struct ListNode* C=newList;
    int carry=0;
    while(l1!=NULL && l2!=NULL){
        int val=l1->val+l2->val+carry;
        carry=val/10;
        val%=10;
        struct ListNode *nNode=(struct ListNode*)malloc(sizeof(struct ListNode));
        nNode->val=val;
        C->next=nNode;
        C=nNode;
        l1=l1->next;
        l2=l2->next;
    }
    while(l1==NULL && l2!=NULL){
        int val=l2->val+carry;
        carry=val/10;
        val%=10;
        l2->val=val;
        C->next=l2;
        C=l2;
        l2=l2->next;
    }
    while(l1!=NULL && l2==NULL){
        int val=l1->val+carry;
        carry=val/10;
        val%=10;
        l1->val=val;
        C->next=l1;
        C=l1;
        l1=l1->next;
    }
    if(carry!=0){
        struct ListNode *nNode=(struct ListNode*)malloc(sizeof(struct ListNode));
        nNode->val=carry;
        C->next=nNode;
        C=nNode;
    }
    C->next=NULL;
    if(newList!=NULL){
        newList=newList->next;
    }
    return newList;
}