题目:
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.
思路:
STL 有一个专门的结构体叫做 div_t
, 其包含两个成员,分别是 quot(quotient) 与 rem(remainder). 用来做什么,从命名上是否可以看出一点端倪呢?
举例说明.
38 / 5 == 7 remainder 3
用 C++ 来描述,便是:
div_t result = div(38, 5);
cout << result.quot << result.rem;
前者为被除后的结果,后者为余数。
代码:
#include <cstddef>
#include <cstdlib>
// 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 dummy(0);
// 创建输出链表指针变量
ListNode *tail = &dummy;
// 初始化div_t变量
div_t sum = { 0, 0 };
for (div_t sum = { 0, 0 }; sum.quot || l1 || l2; tail = tail->next)
{
// 如果l1链表当前位置有数值
if (l1){
sum.quot += l1->val;
l1 = l1->next;
}
// 如果l2链表当前位置有数值
if (l2){
sum.quot += l2->val;
l2 = l2->next;
}
// 计算进位值
sum = div(sum.quot, 10);
//tail->val = sum.rem;
// 创建ListNode对象存储个位值
tail->next = new ListNode(sum.rem);
}
return dummy.next;
}
};