链表感觉忘光了。。。
/**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* ListNode *next;
* ListNode(int x) : val(x), next(NULL) {}
* };
*/
#include <cmath>
class Solution {
public:
ListNode* addTwoNumbers(ListNode* l1, ListNode* l2) {
int num = l1->val + l2->val;
ListNode* head = new ListNode(num%10);
ListNode* k = head;
l1 = l1->next;
l2 = l2->next;
num /= 10;
while(l1 || l2 || num) {
if (l1) {
num += l1->val;
l1 = l1->next;
}
if (l2) {
num += l2->val;
l2 = l2->next;
}
ListNode* temp = new ListNode(num%10);
k->next = temp;
k = k->next;
num /= 10;
}
return head;
}
};