/**
* 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 *result = new ListNode(0);//结果链表
ListNode *head = result;//结果链表的头指针,用来返回结果
int sum = 0;//部分和
while(l1||l2)
{
if(l1)
{
sum += l1->val;
l1 = l1->next;
}
if(l2)
{
sum += l2->val;
l2 = l2->next;
}
result->next = new ListNode(sum%10);//构造新节点
result = result->next;//result指向表尾,用来构造新节点
sum = sum/10;//sum只能为0或为1
}
if(sum)//最高位有进位
result->next = new ListNode(sum%10);
return head->next;
}
};