[LeetCode]2. Add Two Numbers

2. 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

分析

直接顺序遍历两个链表咯

源码

class Solution {
public:
    ListNode* addTwoNumbers(ListNode* l1, ListNode* l2) {
        ListNode* pL1 = l1, *pL2 = l2;
        ListNode* rL = NULL;
        ListNode* currentNode = NULL;
        int carry = 0;
        int a = 0, b = 0;
        while(true) {

            a = 0, b = 0;

            if(pL1) {
                a = pL1->val;
                pL1 = pL1->next;
            }

            if(pL2) {
                b = pL2->val;
                pL2 = pL2->next;
            }

            ListNode* node = new ListNode((a + b + carry) % 10);
            carry = (a + b + carry) / 10;

            if(rL) {
                currentNode->next = node;
            } else {
                rL = node;
            }

            currentNode = node;

            if(!pL1 && !pL2 && carry == 0) {
                break;
            }
        }

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

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值