[leetcode解题]Add Two Numbers

题目

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

代码

ListNode* addTwoNumbers(ListNode* l1, ListNode* l2) {
        ListNode* result = new ListNode(0);
        ListNode* head = result;
        ListNode* temp = NULL;
        int a = 0;
        while (l1 != NULL && l2 != NULL) {
            int sum = l1->val + l2->val + a;
            int b = sum % 10;
            temp = new ListNode(b);
            a = sum / 10;
            result->next = temp;
            result = temp;
            l1 = l1->next;
            l2 = l2->next;
        }
        while (l1 != NULL) {
            int sum = l1->val + a;
            int b = sum % 10;
            temp = new ListNode(b);
            a = sum / 10;
            result->next = temp;
            result = temp;
            l1 = l1->next;
        }
        while (l2 != NULL) {
            int sum = l2->val + a;
            int b = sum % 10;
            temp = new ListNode(b);
            a = sum / 10;
            result->next = temp;
            result = temp;
            l2 = l2->next;
        }
        if (a > 0) {
            temp = new ListNode(a);
            result->next = temp;
            result = temp;
        }
        return head->next;
    }

leetcode解题报告暂不撰写,部分leetcode题目解答请看https://github.com/fanzhaoyun/MyLeetCode,题目持续更新中

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值