2.Add two number[leetcode] 【C++】

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.

解题思路：

1.逐位相加，注意进位

2.最后注意，不要有多余的0，有进位记得输出。

/**
 * 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) {
        ListNode *sum = new ListNode(0);
        ListNode *SUM = new ListNode(0);
        SUM = sum;
        int c = 0;
        while((NULL != l1) || (NULL != l2))
        {  
            
            if(NULL == l1)
            {
                sum -> val = (l2 -> val + c) % 10;
                c = (l2 -> val + c) / 10;
                l2 = l2 -> next;
            }
            else if(NULL == l2)
            {
                sum -> val = (l1 -> val + c) % 10;
                c = (l1 -> val + c) / 10;
                l1 = l1 -> next;
            }
            else if((NULL != l1) || (NULL != l2))
            {
                sum -> val = (l1 -> val + l2 -> val + c)%10;         
                c = (l1 -> val + l2 -> val + c) / 10;
                l1 = l1 -> next;
                l2 = l2 -> next;
            }        
            
            if((NULL != l1) || (NULL != l2))
            {
                ListNode *temp = new ListNode(0);
                sum -> next = temp;
                sum = sum -> next;
            }
            else
            {
                if(c != 0)
                {
                    ListNode *temp = new ListNode(0);
                    sum -> next = temp;
                    sum = sum -> next;
                    sum -> val = c; 
                }
            }
            
        }
        
        return SUM;
    }
};