LeetCode-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.

Input: (2 -> 4 -> 3) + (5 -> 6 -> 4)

Output: 7 -> 0 -> 8

题目解说：给予两组非空非负整数链表，将两个链表的相应位置数字相加取个位数作为新的链表的节点的数值，如有进位则加到下一次计算中，得到一个新的链表。

分情况考虑：①两条链表一样长，则需要考虑最后一次计算是否有进位，如果有需要添加一个新节点存储。

   ②两条链表不一样长，计算的节点超过短链表的节点数之后，长链表剩下的部分也需要与进位做计算 形成新节点。

/* struct ListNode {
     int val;
     ListNode *next;
     ListNode(int x) : val(x), next(NULL) {}
};*/
 
class Solution {
public:
    ListNode* addTwoNumbers(ListNode* l1, ListNode* l2) {
        int temp = 0;               // temp 表示进位
        ListNode* k1 = l1;
        ListNode* k2 = l2;
        ListNode* end = NULL;
        ListNode* answer = NULL;
        int flag = 1;
        while(k1 != NULL && k2 !=NULL) {
            ListNode* Next = new ListNode(0);
            int k = k1->val+k2->val + temp;
            temp = k/10;
            Next->val = k%10;
            if(flag){
             end = Next;
             answer = end;
             flag = 0;
            } else {
                end->next = Next;
                end = Next;
            }
            k1 = k1->next;
            k2 = k2->next;
        }
        if(k1 == NULL&&k2== NULL) { // 两个链表一样长
            if(temp != 0) {
                ListNode* last = new ListNode(temp);
                end->next = last;
             }
            return answer; 	   //返回新链表
        }
        ListNode* one = k1;     // 两个链表不一样长， one 指向较长的数列多余的部分的节点
        if(k2 !=NULL) one = k2;
        while(one){
            int k = temp + one->val;
            temp = k/10;
            ListNode* Next = new ListNode(k%10);
            end->next = Next;
            end = end->next;
            one = one->next;
        }
        if(temp != 0) {
            ListNode* last = new ListNode(temp);
            end->next = last;
        }
        return answer;
    }
};