链表中两数相加

writeeee

于 2021-07-14 19:08:35 发布

阅读量97

点赞数

分类专栏：算法文章标签：链表数据结构 C++ 数字相加算法

本文链接：https://blog.csdn.net/writeeee/article/details/118735012

版权

算法专栏收录该内容

6 篇文章 0 订阅

订阅专栏

 struct ListNode {
     int val;
     ListNode *next;
     ListNode() : val(0), next(nullptr) {}
     ListNode(int x) : val(x), next(nullptr) {}
     ListNode(int x, ListNode *next) : val(x), next(next) {}
 };
class Solution {
public:
    ListNode* addTwoNumbers(ListNode* l1, ListNode* l2) {
        ListNode* p1 = l1;
        ListNode* p2 = l2;
        ListNode* newHeader = new ListNode();
        ListNode* p3 = newHeader;

        int tmp = 0;
        while(p1 || p2)
        {   
            int num1 =  p1 ?  p1->val : 0;
            int num2 =  p2 ? p2->val : 0;   
            int sum = num1 + num2 + tmp;
            tmp = sum/10;
            
            ListNode* tmpNode = new ListNode();
            tmpNode->val = sum % 10;
            p3->next = tmpNode;
            p3 = tmpNode;
            

            if (p1)
            {
                p1 = p1->next;
            }
            
            if(p2)
            {
                p2 = p2->next;
            }
        }

        if(tmp > 0)
        {
            ListNode* tmpNode = new ListNode();
            tmpNode->val = tmp;
            p3->next = tmpNode;
        }

        return newHeader->next;
    }
};