2019-06-29

2.Add Two Numbers

有2个非空的链表，链表每个元素是非负整数。数字按照从低位到高位顺序存储。将2个链表相加，返回新的链表。

举例:

input: (2->4>3) + (5->6-4>)

output:7->0->8

typedef struct node_{
int data;
struct node_ *next;
}node;

node* add_two_list(node *p1, node *p2)
{
node *pNew = NULL;

int num = 0;
int carry = 0;
while(p1  p2)
{
    num = carry;
    if(p1)
    {
        num += p1->data;
        p1=p1->next;
    }

    if(p2)
    {
        num += p2->data;
        p2=p2->next;
    }

    num = num % 10;
    carry = num/10;
    node *pNode = (node *)malloc(sizeof(node));
    pNode->data = num;
    pNode->next = pNew;
    pNew = pNode;
}

if(carry)
{
    node *pNode = (node *)malloc(sizeof(node));
    pNode->data = 1;
    pNode->next = pNew;
    pNew = pNode;
}

return pNew;

}