leetcode-2-两数相加(链表)

#include<vector>
#include<map>
#include<iostream>
#include<memory>
using namespace std;

struct ListNode {
    int val;
    ListNode* next;
    ListNode(int x) : val(x), next(NULL) {}
    
};

ListNode* addTwoNumbers(ListNode* l1, ListNode* l2) {
    if (l1 == NULL)
        return l2;
    if (l2 == NULL)
        return l1;
    ListNode head(0);
    ListNode* pre = &head;
    int twosum;
    bool carryflag = false;//进位标记位
    while (l1 != NULL && l2 != NULL)
    {
        twosum = l1->val + l2->val + carryflag;
        carryflag = twosum / 10;
        ListNode* p = new ListNode(twosum % 10);
        pre->next = p;
        pre = p;
        l1 = l1->next;
        l2 = l2->next;
    }
    if (l1 != NULL) {
        while (l1 != NULL) {
            ListNode* p;
            if (carryflag) {
                twosum = l1->val + carryflag;
                carryflag = twosum / 10;
                p = new ListNode(twosum%10);
            }
            else
                p = new ListNode(l1->val);
            pre->next = p;
            pre = p;
            l1 = l1->next;
        }
    }
    else if (l2 != NULL) {
        while (l2 != NULL) {
            ListNode* p;
            if (carryflag) {
                twosum = l2->val + carryflag;
                carryflag = twosum / 10;
                p = new ListNode(twosum%10);
            }
            else
                p = new ListNode(l2->val);
            pre->next = p;
            pre = p;
            l2 = l2->next;
        }
    }
    if (carryflag) {
        ListNode* p = new ListNode(carryflag);
        pre->next = p;
        pre = p;
    }
    pre->next = NULL;
    return head.next;
}

void ListTravel(ListNode*p)
{
    cout << "ADDR(" << p << ")  ";
    while (p != NULL)
    {
        cout << p->val << "\t";
        p = p->next;
    }cout << endl;
}

int main()
{
    ListNode p1(2), p2(4), p3(3);
    ListNode q1(5), q2(6), q3(4);
    p1.next = &p2; p2.next = &p3; p3.next = NULL;
    q1.next = &q2; q2.next = &q3; q3.next = NULL;
    ListTravel(&p1);
    ListTravel(&q1);
    auto i = addTwoNumbers(&p1, &q1);
    ListTravel(i);
}
  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值