2. Add Two Numbers

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.

来源：力扣（LeetCode）
链接：https://leetcode-cn.com/problems/add-two-numbers
著作权归领扣网络所有。商业转载请联系官方授权，非商业转载请注明出处。

 

思路：

1. 从最低位至最高位，逐位相加，如果和大于等于10，则保留个位数字，同时向前一位进1.
2. 如果最高位有进位，则需在最前面补1.

C：

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     struct ListNode *next;
 * };
 */


struct ListNode* addTwoNumbers(struct ListNode* l1, struct ListNode* l2){
    struct ListNode *res = (struct ListNode *)malloc(sizeof(struct ListNode));
    struct ListNode *cur = res;
    res->next = NULL;
    int carry = 0;
    while(l1 || l2) {
        struct ListNode *tmp = (struct ListNode *)malloc(sizeof(struct ListNode));
        int n1 = l1 ? l1->val:0;
        int n2 = l2 ? l2->val:0;
        int sum = n1 + n2 + carry;
        if(sum >= 10) {
            carry = 1;
            sum = sum - 10;
        }
        else {
            carry = 0;
        }
        tmp->val = sum;
        tmp->next = NULL;
        cur->next = tmp;
        cur = cur->next;
        if(l1) l1 = l1->next;
        if(l2) l2 = l2->next;
    }
    if(carry) {
        struct ListNode *tmp = (struct ListNode *)malloc(sizeof(struct ListNode));
        tmp->next = NULL;
        tmp->val = carry;
        cur->next = tmp;
        cur = cur->next;
    }
    struct ListNode *tmp = res;
    res = res->next;
    free(tmp);
    return res;
}

C++： 

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode(int x) : val(x), next(NULL) {}
 * };
 */
class Solution {
public:
    ListNode* addTwoNumbers(ListNode* l1, ListNode* l2) {
        struct ListNode *res = new ListNode(-1);
        struct ListNode *cur = res;
        int carry = 0;
        while(l1 || l2) {
            int n1 = l1 ? l1->val:0;
            int n2 = l2 ? l2->val:0;
            int sum = n1 + n2 + carry;
            if (sum >= 10) {
                carry = 1;
                sum = sum - 10;
            }
            else {
                carry = 0;
            }
            cur->next = new ListNode(sum);
            cur = cur->next;
            if (l1) l1 = l1->next;
            if (l2) l2 = l2->next;
        }
        if (carry) {
            cur->next = new ListNode(carry);
            cur = cur->next;
        }
        return res->next;
    }
};