[leetcode]-445. Add Two Numbers II（C语言）

You are given two non-empty linked lists representing two non-negative integers. The most significant digit comes first 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.

Follow up:
What if you cannot modify the input lists? In other words, reversing the lists is not allowed.

Example:

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

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     struct ListNode *next;
 * };
 */
typedef struct
{
    int a[10000];
    int len;
}stack;
struct ListNode* addTwoNumbers(struct ListNode* l1, struct ListNode* l2) {
    struct ListNode *hhead=(struct ListNode *)malloc(sizeof(struct ListNode)),*cur;
    cur=hhead;
    stack a1,a2,a3;
    a1.len=0;
    a2.len=0;
    a3.len=0;
    int i=0,j=0,k=0;
    while(l1!=NULL)
    {
        a1.a[i++]=l1->val;
        l1=l1->next;
        (a1.len)++;
    }
    while(l2!=NULL)
    {
        a2.a[j++]=l2->val;
        l2=l2->next;
        (a2.len)++;
    }
    int sum=0;
    while(a1.len>=1||a2.len>=1)
    {
        if(a1.len>=1)
        {
            sum+=a1.a[a1.len-1];
            a1.len--;
        }
        if(a2.len>=1)
        {
            sum+=a2.a[a2.len-1];
            a2.len--;
        }
        a3.a[k++]=sum%10;
        a3.len++;
        sum/=10;
    }
    if(sum!=0)
    {
        a3.a[k++]=sum;
        a3.len++;
    }
    while(a3.len>=1)
    {
        struct ListNode *p=(struct ListNode *)malloc(sizeof(struct ListNode));
        p->val=a3.a[a3.len-1];
        p->next=NULL;
        a3.len--;
        cur->next=p;
        cur=cur->next;
    }
    return hhead->next;
}