【leetcode】【medium】2. Add Two Numbers

最新推荐文章于 2021-11-03 13:44:22 发布

原创最新推荐文章于 2021-11-03 13:44:22 发布 · 162 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

code 同时被 2 个专栏收录

233 篇文章

订阅专栏

c++

230 篇文章

订阅专栏

本文介绍了一个LeetCode上的经典算法题——链表加法。题目要求将两个非空链表表示的非负整数相加，并返回结果作为新的链表。文章详细解释了如何通过设置进位变量和遍历两个链表来解决此问题。

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.

题目链接：https://leetcode-cn.com/problems/add-two-numbers/

思路

主要点在于设立记录进位的变量，以及同时遍历两个链表的方法。

/**
 * 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 *res = new ListNode(0);
        ListNode *end = res;
        int add = 0;
        while(l1 || l2){
            int a = (l1!=NULL)?l1->val : 0;
            int b = (l2!=NULL)?l2->val : 0;
            int tmp = a + b + add;
            add = tmp / 10;
            end->next = new ListNode(tmp % 10);
            end = end->next;
            if(l1!=NULL) l1 = l1->next;
            if(l2!=NULL) l2 = l2->next;
        }
        if (add!=0) end->next = new ListNode(1);
        return res->next;
    }
};