两数相加

题目：给出两个 非空 的链表用来表示两个非负的整数。其中，它们各自的位数是按照 逆序 的方式存储的，并且它们的每个节点只能存储 一位 数字。

如果，我们将这两个数相加起来，则会返回一个新的链表来表示它们的和。

您可以假设除了数字 0 之外，这两个数都不会以 0 开头。

示例：

输入：(2 -> 4 -> 3) + (5 -> 6 -> 4)
输出：7 -> 0 -> 8
原因：342 + 465 = 807

解法一：

常规逻辑

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode(int x) : val(x), next(NULL) {}
 * };
 */
class Solution{
public:
    ListNode* addTwoNumbers(ListNode* l1, ListNode* l2){
        if(l1 == NULL || l2 == NULL)
            return l1 == NULL ? l2 : l1;
        
        ListNode* head = new ListNode(-1);
        ListNode* nodePointer = head;
        int tmp = 0;
        
        while(l1 != NULL || l2 != NULL){
            if(l1 != NULL && l2 != NULL){
                nodePointer->next = new ListNode(-1);
                nodePointer = nodePointer->next;
                nodePointer->val = ((l1->val + l2->val) + tmp) % 10;
                tmp = ((l1->val + l2->val) + tmp) / 10;
            }
            if(l1 != NULL && l2 == NULL){
                nodePointer->next = new ListNode(-1);
                nodePointer = nodePointer->next;
                nodePointer->val = (l1->val + tmp) % 10;
                tmp = (l1->val + tmp) / 10;
            }
            if(l2 != NULL && l1 == NULL){
                nodePointer->next = new ListNode(-1);
                nodePointer = nodePointer->next;
                nodePointer->val = (l2->val + tmp) % 10;
                tmp = (l2->val + tmp) / 10;
            }
            if(l1 != NULL)
                l1 = l1->next;
            if(l2 != NULL)
                l2 = l2->next;
        }
        if(tmp > 0){
            nodePointer->next = new ListNode(-1);
            nodePointer = nodePointer->next;
            nodePointer->val = tmp;
            tmp = 0;
        }
        return head->next;
    }
};

解法二：

常规逻辑+递归

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode(int x) : val(x), next(NULL) {}
 * };
 */
class Solution{
public:
    ListNode* addTwoNumbers(ListNode* l1, ListNode* l2){
        if(l1 == NULL || l2 == NULL)
            return l1 == NULL ? l2 : l1;
        
        int val = l1->val + l2->val;
        ListNode* Node = new ListNode(val % 10);           //用相加后值的个位新建初始化一个节点
        Node->next = addTwoNumbers(l1->next, l2->next);    //新链表的下一个节点
        if(val >= 10)                                      //如果相加后val大于等于10，则需进位
            Node->next = 
                addTwoNumbers(new ListNode(val / 10), Node->next);
        return Node;
    }
};

 

转载于:https://www.cnblogs.com/Sharp-Juan/p/10350386.html