2. Add Two Numbers : LeetCode 题解

Problem Description:
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
C++ Solution:
/**
* Definition for singly-linked list.
* struct ListNode {
*     int val;
*     ListNode *next;
*     ListNode(int x) : val(x), next(NULL) {}
* };
*/
class Solution {
public:
ListNode* addTwoNumbers(ListNode* l1, ListNode* l2) {
    ListNode Dummy(0);
    ListNode* p = &Dummy;

    int count_number = 0;

    while(l1 || l2) {
        int val = count_number + (l1 ? l1->val:0) + (l2 ? l2->val:0);
        count_number = val / 10;
        val = val % 10;
        p->next = new ListNode(val);
        p = p->next;
        if(l1) { l1 = l1->next; }
        if(l2) { l2 = l2->next; }
    }

    if(count_number != 0) {
        p->next = new ListNode(count_number);
        p = p->next;
    }

    return Dummy.next;
}
};

备注:答案多有借鉴,请多担待

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

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值