Add Two Numbers

18 篇文章 1 订阅
7 篇文章 0 订阅

Question :

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

code:

class Solution {  
public:  
   ListNode *addTwoNumbers(ListNode *l1, ListNode *l2)
{

    ListNode* phead =new ListNode(0);
    ListNode* pTail =phead;
    //int *temp ;
    int carry = 0;

    if(!l1)
        return l2;
    if(!l2)
        return l1;
    while(l1&&l2)
    {
        int val= l1->val+l2->val+carry;
        carry = val/10;

        pTail->next = new ListNode(val%10);
        pTail = pTail->next;
        l1 = l1->next;
        l2 = l2->next;
    }
    ListNode* left = l1?l1:l2;
    while(left)
    {
        int val= left->val+carry;
        carry = val/10;
        pTail->next= new ListNode(val%10);
        pTail = pTail->next;
        left = left->next;
    }
    if(carry)
    {
        pTail->next= new ListNode(carry);
        pTail->next->next = NULL;
    }
    return phead->next;
}

};  


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

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

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

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值