链表篇-BM11 链表相加(二)

BM11 链表相加(二)

描述
假设链表中每一个节点的值都在 0 - 9 之间，那么链表整体就可以代表一个整数。
给定两个这种链表，请生成代表两个整数相加值的结果链表。
数据范围：0≤n,m≤1000000，链表任意值0≤val≤9
要求：空间复杂度 O(n)，时间复杂度 O(n)

例如：链表 1 为 9->3->7，链表 2 为 6->3，最后生成新的结果链表为 1->0->0->0。

解法

/**
 * struct ListNode {
 *	int val;
 *	struct ListNode *next;
 * };
 */

/**
 * 
 * @param head1 ListNode类 
 * @param head2 ListNode类 
 * @return ListNode类
 */
typedef struct ListNode* pnode; 
static struct ListNode* ReverseList(struct ListNode* pHead ) {
    // write code here
    pnode p = NULL ;
    pnode q = pHead;
    while(q)
    {
        pnode m = q->next;
        q->next = p ;
        p = q ;
        q = m ;
    }
    return p;
}

struct ListNode* addInList(struct ListNode* head1, struct ListNode* head2 ) {
    // write code here
    pnode phead,p,p_pre;
    p = phead = malloc(sizeof(struct ListNode));
    if(!head1)return head2;
    if(!head2)return head1;
    head1 = ReverseList(head1);
    head2 = ReverseList(head2);   
    int addl = 0;
    while(head1&&head2)
    {
        p->val = head1->val + head2->val +addl;
        addl = p->val/10;
        p->val %= 10;
        p->next = malloc(sizeof(struct ListNode));
        p_pre = p;
        p = p->next;
        head1=head1->next;
        head2=head2->next;
        //addl = 0;
    }
    while(head1)
    {
        p->val = head1->val +addl;
        addl = p->val/10;
        p->val %= 10;
        p->next = malloc(sizeof(struct ListNode));
        p_pre = p;
        p = p->next;
        head1=head1->next;
    }
    while(head2)
    {
        p->val = head2->val +addl;
        addl = p->val/10;
        p->val %= 10;
        p->next = malloc(sizeof(struct ListNode));
        p_pre = p;
        p = p->next;
        head2=head2->next;
    }
    if(addl)
    {
        p->val = addl;
        p->next = NULL;
    }else{
        free(p);
        p_pre->next = NULL;
    }
    return ReverseList(phead);
}