2.add two numbers

weixin_34351321

于 2018-06-13 00:30:00 发布

阅读量63

点赞数

CC 4.0 BY-SA版权

原文链接：http://www.cnblogs.com/zx-y/p/10848352.html

本文介绍了一种使用链表实现加法运算的方法。该方法接受两个非空链表作为输入，每个链表代表一个非负整数，数字以逆序方式存储在链表中。文章详细解释了如何将这两个链表相加并返回一个新的链表表示结果。

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

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
Explanation: 342 + 465 = 807.

# Definition for singly-linked list.


# class ListNode:
#     def __init__(self, x):
#         self.val = x
#         self.next = None




class Solution:

    def addTwoNumbers(self, l1, l2):
        """
        :type l1: ListNode
        :type l2: ListNode
        :rtype: ListNode
        """
        dummy=cur=ListNode(0)
        carry=0
        while l1 or l2 or carry: 
            if l1:
                carry+=l1.val
                l1=l1.next
            if l2:
                carry+=l2.val
                l2=l2.next
                
            cur.next=ListNode(carry%10)
            cur=cur.next
            carry//=10
        return dummy.next

转载于:https://www.cnblogs.com/zx-y/p/10848352.html