2. Add Two Numbers C++、Python

最新推荐文章于 2021-11-11 20:03:52 发布

原创最新推荐文章于 2021-11-11 20:03:52 发布 · 278 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#LeetCode

LeetCode 专栏收录该内容

19 篇文章

订阅专栏

本文详细解析了使用链表结构进行两个数相加的算法实现，提供了C++和Python两种语言的代码示例。通过迭代遍历链表节点，逐位相加并处理进位，最终返回相加后的链表结果。

题目链接：2. Add Two Numbers

栈实现数字加法

C++

class Solution{
public:
    ListNode* addTwoNumbers(ListNode* l1,ListNode* l2){
        int sum=0;
        ListNode* dummpy =new ListNode(0), *cur = dummpy;
        while(l1||l2){
            int val1 = l1?l1->val:0;
            int val2 = l2?l2->val:0;
            sum+=val1+val2;
            cur->next =new ListNode(sum%10);
            sum/=10;
            cur = cur->next;
            l1 = l1?l1->next:l1;
            l2 = l2?l2->next:l2;
        }
        if(sum)cur->next= new ListNode(sum);
        cur= dummpy->next;
        delete dummpy;
        return cur;
    }
};

//C++
class Solution {
public:
    ListNode* addTwoNumbers(ListNode*l1, ListNode*l2){
        int carry =0;
        ListNode* ans = new ListNode(-1);
        ListNode* cur = ans;
        while(l1||l2||carry){
            int val = carry +(l1?l1->val:0)+(l2?l2->val:0);
            l1 = l1?l1->next:l1;
            l2 = l2?l2->next:l2;
            carry = val/10;
            cur->next = new ListNode(val%10);
            cur=cur->next;
        }
        return ans->next;
}
};

Python

class Solution:
    def addTwoNumbers(self, l1: ListNode, l2: ListNode) -> ListNode:
        ans = cur = ListNode(0)
        sum =0
        while l1 or l2 or sum:
            if l1:sum+=l1.val; l1=l1.next
            if l2:sum+=l2.val; l2=l2.next
            cur.next = ListNode(sum%10)
            sum//=10
            cur=cur.next
        return ans.next