【leetcode】#2 Add Two Numbers【Linked List】【Medium】

最新推荐文章于 2019-07-15 21:42:49 发布

熔岩XXX

最新推荐文章于 2019-07-15 21:42:49 发布

阅读量245

点赞数

分类专栏： C++ 算法文章标签： C++ 算法

本文链接：https://blog.csdn.net/Rongyan97718/article/details/89644097

版权

C++ 同时被 2 个专栏收录

12 篇文章 0 订阅

订阅专栏

算法

7 篇文章 0 订阅

订阅专栏

2. Add Two Numbers

You are given two non-empty linked lists representing two non-negative integers. 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.

You may assume the two numbers do not contain any leading zero, except the number 0 itself.

Example:

Input: (2 -> 4 -> 3) + (5 -> 6 -> 4)
Output: 7 -> 0 -> 8
Explanation: 342 + 465 = 807.

题目大意

给出两个非空链表，用链表来表示非负整数。整数以小端模式存储，你的任务是将这两个整数相加，然后以同样的形式返回一个链表。

解题思路

设置一个进位C，将链表从头到尾逐项相加，将结果存储输出即可

AC代码

class Solution {
public:
    ListNode* addTwoNumbers(ListNode* l1, ListNode* l2) {
        vector<int> v;
        int c = 0;
        ListNode *p1 = l1, *p2 = l2;
        while(p1 && p2) {
            int tmp = p1->val + p2->val + c;
            v.push_back(tmp % 10);
            c = tmp / 10;
            p1 = p1->next;
            p2 = p2->next;
        }
        while (p1) {
            int tmp = p1->val + c;
            v.push_back(tmp % 10);
            c = tmp / 10;
            p1 = p1->next;
        }
        while (p2) {
            int tmp = p2->val + c;
            v.push_back(tmp % 10);
            c = tmp / 10;
            p2 = p2->next;
        }
        if(c != 0) v.push_back(c);
        ListNode* ans = new ListNode(0), *p;
        p = ans;
        for(int i = 0; i < v.size(); i++) {
            ListNode* node = new ListNode(v[i]);
            p->next = node;
            p = p->next;
        }
        return ans->next;
    }
};