2. Add Two Numbers

题目描述

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.

解题代码

 class Solution {
 public:
     ListNode* addTwoNumbers(ListNode* l1, ListNode* l2) {
         if (l1 == nullptr)
             return l2;
         if (l2 == nullptr)
             return l1;
         ListNode * LN1 = l1, *LN2 = l2, *sum = nullptr, *current = nullptr;
         int carry = 0;
         sum = current = new ListNode((LN1->val + LN2->val) % 10);
         if ((LN1->val + LN2->val) / 10 > 0)
             carry = 1;
         LN1 = LN1->next;
         LN2 = LN2->next;
         while (LN1 != nullptr && LN2 != nullptr)
         {
             int temp = LN1->val + LN2->val + carry;
             current->next = new ListNode(temp % 10);
             current = current->next;
             LN1 = LN1->next;
             LN2 = LN2->next;
             carry = temp / 10;
         }
         ListNode * temp = LN1 != nullptr ? LN1 : LN2;
         while (temp != nullptr)
         {
             int value = temp->val + carry;
             current->next = new ListNode(value % 10);
             current = current->next;
             carry = value / 10;
             temp = temp->next;
         }
         if (carry != 0) {
             current->next = new ListNode(1);
         }
         return sum;
     }
 };

解题思路

1. 看懂题目，两个数相加并非简单的对应位相加，还要考虑进位问题。
2. 要考虑传入参数问题，判断是否为nullptr。
3. 题目没有说可以修改原有链接，所以最好不要修改。
4. 新链表需要两个指针，一个指向头部，一个跟着链表移动，所以在循环外就需要new一个节点，让两个指针都指向这个节点。接着再用循环让current指针移动。
5. 要注意指针的移动是LN1 = LN1->next;，不是LN1++。
6. 循环内new对象是current->next = new ListNode(value % 10);current = current->next;，不是’current = current->next;current= new ListNode(value % 10);’（current是当前有内容非nullptr的节点）
7. 最后，记得如果最高位还要进位的话记得再多增添最后一个节点。