题目如下：
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. —— [ LeetCode ]
代码如下：
/** * 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 *obj,*temp; int carry=0; obj=new ListNode((l1->val+l2->val)%10); temp=obj; carry=(l1->val+l2->val)/10; l1=l1->next; l2=l2->next; while(l1!=NULL&&l2!=NULL) { temp->next=new ListNode((l1->val+l2->val+carry)%10); carry=(l1->val+l2->val+carry)/10; l1=l1->next; l2=l2->next; temp=temp->next; } if(l1!=NULL) { while(l1!=NULL) { temp->next=new ListNode((l1->val+carry)%10); carry=(l1->val+carry)/10; l1=l1->next; temp=temp->next; } if(carry!=0) { temp->next=new ListNode(carry); } } else if(l2!=NULL) { while(l2!=NULL) { temp->next=new ListNode((l2->val+carry)%10); carry=(l2->val+carry)/10; l2=l2->next; temp=temp->next; } if(carry!=0) { temp->next=new ListNode(carry); } } else if(carry!=0) { temp->next=new ListNode(carry); } return obj; } };