#167 Add Two Numbers

题目描述：

You have two numbers represented by a linked list, where each node contains a single digit. The digits are stored inreverse order, such that the 1's digit is at the head of the list. Write a function that adds the two numbers and returns the sum as a linked list.

Have you met this question in a real interview? 

Yes

Example

Given 7->1->6 + 5->9->2. That is, 617 + 295.

Return 2->1->9. That is 912.

Given 3->1->5 and 5->9->2, return 8->0->8.

题目思路：

这题就是l1和l2每个digit上的数两两相加，注意要考虑carry就好了。

Mycode（AC = 13ms）：

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode(int x) : val(x), next(NULL) {}
 * };
 */
class Solution {
public:
    /**
     * @param l1: the first list
     * @param l2: the second list
     * @return: the sum list of l1 and l2 
     */
    ListNode *addLists(ListNode *l1, ListNode *l2) {
        // write your code here
        int carry = 0;
        ListNode *dummy = new ListNode(0);
        ListNode *node = dummy;
        
        // for l1 and l2 both have digits
        while (l1 && l2) {
            node->next = new ListNode(0);
            node->next->val = (l1->val + l2->val + carry) % 10;
            carry = (l1->val + l2->val + carry) / 10;
            
            node = node->next;
            l1 = l1->next;
            l2 = l2->next;
        }
        
        // for l1 longer than l2
        while (l1) {
            node->next = new ListNode(0);
            node->next->val = (l1->val + carry) % 10;
            carry = (l1->val  + carry) / 10;
            
            node = node->next;
            l1 = l1->next;
        }
        
        // for l2 longer than l1
        while (l2) {
            node->next = new ListNode(0);
            node->next->val = (l2->val + carry) % 10;
            carry = (l2->val  + carry) / 10;
            
            node = node->next;
            l2 = l2->next;
        }
        
        // if carry > 0, then add carry at end of list
        if (carry > 0) {
            node->next = new ListNode(carry);
        }
        
        return dummy->next;
    }
};