Description
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.
Solution 1(C++)
class Solution{
public:
ListNode* addTwoNumbers(ListNode* l1, ListNode* l2) {
int carry = 0;
ListNode* node = new ListNode(0);
ListNode* head = node;
ListNode* pre = nullptr;
while(l1 != nullptr || l2 != nullptr){
if(l1 == nullptr) l1 = new ListNode(0);
if(l2 == nullptr) l2 = new ListNode(0);
if(node->next == nullptr) node->next = new ListNode(0);
int result = l1->val+l2->val+carry;
node->val = result % 10;
carry = result / 10;
pre = node;
node = node->next;
l1 = l1->next;
l2 = l2->next;
}
pre->next = nullptr;
if(carry == 1) pre->next = new ListNode(1);
return head;
}
};
算法分析
注意进位carry的设置。
程序分析
注意我在程序中用了这样一行命令:
if(node->next == nullptr) node->next = new ListNode(0);
这是为了保证新的链表每个节点都有下一个,但是这样会导致最后的节点多一个。那么我就设置了一个pre保存每个节点上一个节点,然后将多余的删除,但是要注意,如果最后carry为1,那么就要再补上一个节点,所以有这样的命令:
pre->next = nullptr;
if(carry == 1) pre->next = new ListNode(1);