题目
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.
解析
输入两个链表,分别代表两个正整数,且反向(从低位到高位)存储数字,正好可以从前向后依次相加,需要注意1)判断两个链表当前节点是否为空,若有其一不为空的,则相加,其中空的置为0,2)处理进位的问题。
C++ 代码:
class Solution {
public:
ListNode* addTwoNumbers(ListNode* l1, ListNode* l2) {
// 新建 dummy作为新链表指针,cur作为移动指针
ListNode *dummy = new ListNode(-1), *cur = dummy;
// carry 记录进位
int carry = 0;
// 两个节点指针,有一个不为空,则相加
while (l1 || l2) {
// 当前节点数值,空则取0
int val1 = l1 ? l1->val : 0;
int val2 = l2 ? l2->val : 0;
// 相加
int sum = val1 + val2 + carry;
// 计算进位,sum是否大于10
carry = sum / 10;
// 新建节点,保存sum的低位
cur->next = new ListNode(sum % 10);
// 移动cur
cur = cur->next;
// 移动l1,l2
if (l1) l1 = l1->next;
if (l2) l2 = l2->next;
}
// 注意最后的进位
if (carry) cur->next = new ListNode(1);
return dummy->next;
}
};