LeetCode 2. Add Two Numbers

最新推荐文章于 2024-01-03 15:29:28 发布

David_DLUT

最新推荐文章于 2024-01-03 15:29:28 发布

阅读量211

点赞数

分类专栏： LeetCode 文章标签： leetcode

本文链接：https://blog.csdn.net/David_DLUT/article/details/53941518

版权

LeetCode 专栏收录该内容

42 篇文章 0 订阅

订阅专栏

You are given two linked lists representing two non-negative numbers. 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.

Input: (2 -> 4 -> 3) + (5 -> 6 -> 4)
Output: 7 -> 0 -> 8

/**
 * 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) {
        return addTwoNumbers(l1, l2, 0);    
    }
private:
    ListNode* addTwoNumbers(ListNode *l1, ListNode *l2, int carry) {
        if ((l1 == NULL) && (l2 == NULL)) {
            if (carry == 1) {
                return new ListNode(1);
            }
            else {
                return NULL;
            }
        }
        ListNode *node = new ListNode(carry);
        if (l1 != NULL) {
            node->val += l1->val;
            l1 = l1->next;
        }
        if (l2 != NULL) {
            node->val += l2->val;
            l2 = l2->next;
        }
        carry = node->val / 10;
        node->val %= 10;
        node->next = addTwoNumbers(l1, l2, carry);
        return node;
    }
};