LeetCode - 2. Add Two Numbers

最新推荐文章于 2025-06-10 09:50:10 发布

原创最新推荐文章于 2025-06-10 09:50:10 发布 · 237 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#leetcode

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

25 篇文章

订阅专栏

LeetCode

21 篇文章

订阅专栏

本文介绍了一种解决两数相加问题的方法，通过链表形式存储逆序的数字，实现了两个非负整数的相加，并返回结果作为新的链表。

问题

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.

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:
    //我的方法，胜过80%人
    ListNode* addTwoNumbers(ListNode* l1, ListNode* l2) {
        if(l1 == NULL) return l2;
        if(l2 == NULL) return l1;
        ListNode *head = l1,*rear;
        int flag = 0;   //进位
        int sum;
        while(l1 || l2)
        {
            if(l1 && l2 )
            {
                sum = l1->val + l2->val + flag;
                l1->val = sum % 10;
                flag = sum / 10;
                rear = l1;
                l1 = l1->next;
                l2 = l2->next;
            }
            else if(l1 && l2 == NULL)
            {
                sum = l1->val + flag;
                l1->val = sum % 10;
                flag = sum / 10;
                rear = l1;
                l1 = l1->next;
            }
            else if(l1 == NULL && l2)
            {
                sum = l2->val + flag;
                l2->val = sum % 10;
                flag = sum / 10;
                rear = rear->next = l2;
                l2 = l2->next;
            }
        }
        if(flag)  //加到最后，如果有进位，则新建一个节点
            rear->next = new ListNode(1);
        return head;
    }
};