Add Two Numbers

最新推荐文章于 2024-05-07 14:18:04 发布

SENLINZM

最新推荐文章于 2024-05-07 14:18:04 发布

阅读量825

点赞数

CC 4.0 BY-SA版权

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

本文链接：https://blog.youkuaiyun.com/SENLINZM/article/details/39010181

leetcode 专栏收录该内容

13 篇文章

订阅专栏

本文介绍了一种解决两数相加问题的方法，通过链表形式存储逆序数字，并返回相加后的链表结果。具体实现涉及遍历两个链表节点、处理进位等步骤。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

问题描述

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

解决方案

class Solution {
public:
    ListNode *addTwoNumbers( ListNode *l1, ListNode *l2 ) {
        ListNode *result = nullptr;
	    ListNode *current = nullptr;
	    
	    int next = 0;
	    auto t1 = l1;
	    auto t2 = l2;
        
        for( ; t1 != nullptr && t2 != nullptr; t1 = t1->next, t2 = t2->next ) {
	        int value = t1->val + t2->val + next;
	        next = value / 10;
	        auto *temp = new ListNode{ value % 10 };
            if( result == nullptr ) {
                result = temp;
            } else {
                current->next = temp;
            }
	        current = temp;
        }
        
        for( ; t1 != nullptr; t1 = t1->next ) {
	        int value = t1->val + next;
	        next = value / 10;
	        auto *temp = new ListNode{ value % 10 };
            current->next = temp;
	        current = temp;
        }
        
	    for( ; t2 != nullptr; t2 = t2->next ) {
	        int value = t2->val + next;
	        next = value / 10;
	        auto *temp = new ListNode{ value % 10 };
            current->next = temp;
	        current = temp;
        }
        
	    if( next == 1 ) {
	        current->next = new ListNode{ 1 };
	    }
	    
	    return result;
    }
};