leetcode2--Add Two Numbers

最新推荐文章于 2019-04-16 00:35:17 发布

不停前进的灰熊君

最新推荐文章于 2019-04-16 00:35:17 发布

阅读量250

点赞数

分类专栏： leetcode

本文链接：https://blog.csdn.net/chuxuan12345/article/details/50456818

版权

leetcode 专栏收录该内容

5 篇文章 0 订阅

订阅专栏

题目：

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

Subscribe to see which companies asked this question

自己翻译：就是两个非负数链表从左向右依次相加，逢十进一，输出相加后的链表。

代码：

class Solution {
public:
    ListNode* addTwoNumbers(ListNode* l1, ListNode* l2) {
        ListNode *p1 = l1, *p2 = l2, *ahead = NULL, *p = NULL;
        int carry = 0;
        while(p1 || p2 || carry)
        {
            int tp = 0;
            if(p1)
            {
                tp += p1->val;
            }
            if(p2)
            {
                tp += p2->val;
            }
            if(carry)
                tp += carry;
            if(p1)
                p1 = p1->next;
            if(p2)
                p2 = p2->next;
            if(tp >= 10)
            {
                carry = 1;
                tp %= 10;
            }
            else
                carry = 0;
            if(!ahead)
            {
                ahead = new ListNode(tp);
                p = ahead;
            }
            else
            {
                p->next = new ListNode(tp);
                p = p->next;
            }
            
        }
        
        return ahead;
    }
};