2.2.1Add Two Numbers

最新推荐文章于 2025-05-28 15:03:32 发布

原创最新推荐文章于 2025-05-28 15:03:32 发布 · 519 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

收录于

leetcode

当前文章被收录于：

leetcode

54 篇文章 0 人学习

订阅专栏查看详情

当前文章被以下社区和专栏收录：

Notes:
	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

	Solution: dummy head...

	*/

	/**

class Solution {
public:
    ListNode *addTwoNumbers(ListNode *l1, ListNode *l2) {
        ListNode dummy(0), *cur = &dummy;
        int carry = 0;
        while (l1 || l2 || carry)
        {
            int sum = carry;
            if (l1) {
                sum += l1->val;
                l1 = l1->next;
            }
            if (l2) {
                sum += l2->val;
                l2 = l2->next;
            }
            carry = sum >= 10 ? 1 : 0;
            sum %= 10;
            ListNode *newNode = new ListNode(sum);
            cur->next = newNode;
            cur = newNode;
        }
        return dummy.next;
    }
};