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.

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

分析：问题要求计算两个链表的和，与正常的计算规则正好相反，即各位->十位->百位...的顺序，其中1）当某一值为个位数时，和为该数；2）当和超过10向下一位进1.

解答：

class Solution {

public:
      ListNode* addTwoNumbers(ListNode* list1, ListNode* list2){//list1和list2为两个链表
int sum = 0;
ListNode  *newList = new ListNode(0);//定义新的链表用来表示计算结果
ListNode * d = newList;
while (list1 || list2 || sum){  //当两个链表都为空切之前的计算结果整除10的结果为0时，循环停止
if (list1) {//链表不为空时，将值加载sum上，并指向该链表的下一节点
sum += list1->val;
list1 = list1->next;
}
if (list2){//链表不为空时，将值加载sum上，并指向该链表的下一节点
sum += list2->val;
list2 = list2->next;
}
d->next = new ListNode(sum % 10);//将结果的各位赋给链表新的节点
d = d->next;
sum /= 10;//将sum整除10的结果赋给sum， 当和超过10向下一位进1.
}
return newList->next;
}
};