标签:
/*** 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 stackAnchor(0);ListNode* tail = &stackAnchor;div_t sum = { 0, 0 };while(sum.quot > 0 || l1 || l2){if (l1){sum.quot += l1->val;l1 = l1->next;}if (l2){sum.quot += l2->val;l2 = l2->next;}sum = div(sum.quot, 10);tail->next = new ListNode(sum.rem);tail = tail->next;}return stackAnchor.next;}};
标签:
原文地址:http://www.cnblogs.com/ssy-zju/p/4625546.html