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

最新推荐文章于 2020-08-04 21:50:16 发布

shen_zhu

最新推荐文章于 2020-08-04 21:50:16 发布

阅读量313

点赞数

本文链接：https://blog.csdn.net/shen_zhu/article/details/82011440

版权

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.

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     struct ListNode *next;
 * };
 */
struct ListNode* addTwoNumbers(struct ListNode* l1, struct ListNode* l2) {
    struct ListNode *cur,*hhead=(struct ListNode *)malloc(sizeof(struct ListNode));
    cur=hhead;
    int sum=0;
    while(l1!=NULL||l2!=NULL)
    {
        if(l1!=NULL)
        {
            sum+=l1->val;
            l1=l1->next;
        }
        if(l2!=NULL)
        {
            sum+=l2->val;
            l2=l2->next;
        }
        struct ListNode *p=(struct ListNode *)malloc(sizeof(struct ListNode));
        p->val=sum%10;
        p->next=NULL;
        cur->next=p;
        sum/=10;
        cur=cur->next;
    }
    if(sum==1)
    {
        struct ListNode *p=(struct ListNode *)malloc(sizeof(struct ListNode));
        p->val=1;
        p->next=NULL;
        cur->next=p;
    }
    return hhead->next;
}