Add Two Numbers

You are given two linked lists representing two non-negative numbers. 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.

Input: (2 -> 4 -> 3) + (5 -> 6 -> 4)
Output: 7 -> 0 -> 8

思路：

思路非常简单，利用两个指针分别遍历两个链表，并且用一个变量表示是否有进位。某个链表遍历结束之后再将另一个链表连接在结果链表之后即可，若最后有进位需要添加一位。

要考虑的因素：

1、每一节点的数是在进位前是1位

2、两个链表的长度可能不同

3、进位的那些书添加在下一个节点的数据上

<pre name="code" class="cpp">/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode(int x) : val(x), next(NULL) {}
 * };
 */
 
int add(int a, int b, int &carry)
{
    int c = a + b + carry;
    
    carry = c / 10;
    return c % 10;
}
 
ListNode *add_two_numbers(ListNode *l1, ListNode *l2) 
{
    ListNode *head = NULL, *rear = NULL;
    
    if (l1 == NULL) return l2;
    if (l2 == NULL) return l1;
    
    int carry = 0;
    
    while (l1 != NULL || l2 != NULL)
    {
        int val = 0;
        
        if (l1 == NULL)
        {
            val = add(0, l2->val, carry);
            l2 = l2->next;
        }
        else if (l2 == NULL)
        {
            val = add(l1->val, 0, carry);
            l1 = l1->next;
        }
        else
        {
            val = add(l1->val, l2->val, carry);
            l1 = l1->next;
            l2 = l2->next;
        }
        
        ListNode *new_node = new ListNode(val);
        
        if (head == NULL) head = new_node;
        if (rear == NULL)
        {
            rear = new_node;
        }
        else
        {
            rear->next = new_node;
            rear = rear->next;
        }
    }
    
    if (carry != 0 && rear != NULL)
    {
        rear->next = new ListNode(carry);
    }
    
    return head;
}