[LeetCode] Add Two Numbers 两个数字相加

原创于 2019-07-11 13:47:22 发布 · 121 阅读

0 ·

CC 4.0 BY-SA版权

LeetCode 专栏收录该内容

5 篇文章

订阅专栏

博客介绍了将两个用链表逆序表示的非负整数相加的问题。给出示例，如(2 -> 4 -> 3) + (5 -> 6 -> 4)结果为7 -> 0 -> 8 ，对应342 + 465 = 807 ，并提供了C++解法代码。

摘要生成于 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.

C++ 解法：
class Solution {
public:
ListNode* addTwoNumbers(ListNode* l1, ListNode* l2) {
ListNode *dummy = new ListNode(-1), *cur = dummy;
int carry = 0;
while (l1 || l2) {
int val1 = l1 ? l1->val : 0;
int val2 = l2 ? l2->val : 0;
int sum = val1 + val2 + carry;
carry = sum / 10;
cur->next = new ListNode(sum % 10);
cur = cur->next;
if (l1) l1 = l1->next;
if (l2) l2 = l2->next;
}
if (carry) cur->next = new ListNode(1);
return dummy->next;
}
};