Leetcode 2. Add Two Numbers

本文首发于每日一题：2 - 咸鱼Blog
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 contains a single digit. Add the two numbers and return the sum as a linked list

You may assume the two numbers do not contain any leading zero, except the number 0 itself.

Example 1:
 

Input: l1=[2,4,3], l2=[5,6,4]
Output: [7,0,8]
Explanation: 342+465=807

Example 2:

Input: l1=[0], l2=[0]
Output: [0]

Example 3:

Input: l1=[9,9,9,9,9,9,9], l2=[9,9,9,9]
Output: [8,9,9,9,0,0,0,1]

Solution code

struct ListNode* addTwoNumbers(struct ListNode* l1, struct ListNode* l2){
    int increase=0;
    struct ListNode *l3;
    struct ListNode *p3=l3;
    struct ListNode *p1=l1;
    struct ListNode *p2=l2;
    while(p1&&p2){
        struct ListNode *new;
        new=(struct ListNode*)malloc(sizeof(struct ListNode));
        new->val=p1->val+p2->val+increase;
        increase=0;
        while(new->val>9){
            new->val-=10;
            increase+=1;
        }
        new->next=NULL;
        if(p3)p3->next=new;
        else l3=new;
        p3=new;
        p2=p2->next;
        p1=p1->next;
    }
    while(p1){
        struct ListNode *new;
        new=(struct ListNode*)malloc(sizeof(struct ListNode));
        new->val=p1->val+increase;
        increase=0;
        while(new->val>9){
            new->val-=10;
            increase+=1;
        }
        new->next=NULL;
        if(p3)p3->next=new;
        else l3=new;
        p3=new;
        p1=p1->next;
    }
    while(p2){
        struct ListNode *new;
        new=(struct ListNode*)malloc(sizeof(struct ListNode));
        new->val=p2->val+increase;
        increase=0;
        while(new->val>9){
            new->val-=10;
            increase+=1;
        }
        new->next=NULL;
        if(p3)p3->next=new;
        else l3=new;
        p3=new;
        p2=p2->next;
    }
    if(increase){
        struct ListNode *new;
        new=(struct ListNode*)malloc(sizeof(struct ListNode));
        new->val=increase;
        increase=0;
        new->next=NULL;
        if(p3)p3->next=new;
        else l3=new;
        p3=new;
    }
    return l3;    
}

Note:

1. 这是相当于对两个链表进行一次遍历，因此复杂度为$O(M+N)$;
2. 需要注意的是进位可能从两个链表皆有余的情况进位给仅剩单个链表的情况，进而进位给原来没有的数位。