2. Add Two Numbers

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

Super_Whw

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

阅读量64

点赞数

分类专栏： Leetcode Favorate [图解]

本文链接：https://blog.csdn.net/weixin_42939835/article/details/106617951

版权

Leetcode Favorate [图解] 专栏收录该内容

68 篇文章 1 订阅

订阅专栏

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.

Solution

C++

/**
 * 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) {
        ListNode* head = new ListNode(0);
        ListNode* res = head;
        int add = 0;
        while(l1 || l2 || add) {
            int val1 = l1 ? l1->val : 0;
            int val2 = l2 ? l2->val : 0;
            res->next = new ListNode((val1+val2+add)%10);
            add = (val1 + val2 + add)/10;
            l1 = l1 ? l1->next : NULL;
            l2 = l2 ? l2->next : NULL;
            res = res->next;
        }
        return head->next;
    }
};

Python

# Definition for singly-linked list.
# class ListNode:
#     def __init__(self, x):
#         self.val = x
#         self.next = None

class Solution:
    def addTwoNumbers(self, l1: ListNode, l2: ListNode) -> ListNode:
        head = res = ListNode(0)
        add = 0
        while l1 != None or l2 != None or add:
            val1  = (l1.val if l1 else 0)
            val2  = (l2.val if l2 else 0)
            res.next = ListNode((val1 + val2 + add) % 10)
            add = (val1 + val2 + add) // 10
            l1 = (l1.next if l1 else None)
            l2 = (l2.next if l2 else None)
            res = res.next
        return head.next