Add Two Numbers

最新推荐文章于 2024-05-07 14:18:04 发布

PaQiuQiu

最新推荐文章于 2024-05-07 14:18:04 发布

阅读量132

点赞数

CC 4.0 BY-SA版权

分类专栏：教练，我想学设计之禅 C++《i+1》

本文链接：https://blog.youkuaiyun.com/lxy_2011/article/details/95986737

C++《i+1》同时被 2 个专栏收录

166 篇文章 ¥15.90 ¥99.00

订阅专栏

超级会员免费看

教练，我想学设计之禅

62 篇文章 ¥19.90 ¥99.00

订阅专栏

超级会员免费看

这道题目要求将两个反向存储非负整数的链表相加，返回结果仍为链表形式。需要处理进位问题，并可能使用哑节点来辅助操作。示例中提到了div_t结构体用于表示整数除法的结果。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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.

Code:

class Solution {
public:
	ListNode *addTwoNumbers(ListNode *l1, ListNode *l2) {
		ListNode dummy(0), *tail = &dummy;
		for (div_t sum{ 0, 0 }; sum.quot || l1 || l2; tail = tail->next) {
			if (l1) { sum.quot += l1->val; l

了解本专栏