Add Two Numbers

最新推荐文章于 2021-02-19 08:37:33 发布

leonordo

最新推荐文章于 2021-02-19 08:37:33 发布

阅读量507

点赞数

分类专栏： leetcode 文章标签： leetcode

本文链接：https://blog.csdn.net/guoyilin/article/details/46809465

版权

leetcode 专栏收录该内容

46 篇文章 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

/**
 * 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 *output = NULL;
        ListNode *current = output;
        ListNode* start1 = l1;
        ListNode* start2 = l2;
        int up = 0;
        while(start1!= NULL || start2 != NULL)
        {
            int value = up;
            if(start1 != NULL)
                value += start1->val;
            if(start2 != NULL)
                value += start2->val;
            up = value / 10; 
            value = value % 10;
            ListNode *node = new ListNode(value);//ListNode node(value);the memory is allocated on stack, will free soon. 
            if(current == NULL)
            {
                current = node;
                output = node;
            }
            else{
                current->next = node;
                current = node;
            }
            if(start1 != NULL)
                start1 = start1->next;
            if(start2 != NULL)
                start2 = start2->next;
        }
        if(up > 0)
        {
            ListNode *node = new ListNode(up);
            current->next = node;
        }
        return output;
    }
};