LeetCodeOJ:2. Add Two Numbers

原创于 2016-03-20 14:20:35 发布 · 373 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#LeetCode #OJ #python

OJ 同时被 2 个专栏收录

107 篇文章

订阅专栏

python

21 篇文章

订阅专栏

本文介绍了一种使用Python实现两个链表相加的方法。输入的两个链表分别表示两个非负整数，数字以逆序存储，每个节点包含一个数字。算法将这两个数相加，并以链表形式返回结果。

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

Total Accepted: 129010 Total Submissions: 572407 Difficulty: Medium

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

Language:python

# Definition for singly-linked list.
# class ListNode(object):
#     def __init__(self, x):
#         self.val = x
#         self.next = None

class Solution(object):
    def addTwoNumbers(self, l1, l2):
        """
        :type l1: ListNode
        :type l2: ListNode
        :rtype: ListNode
        """
        ans = ListNode(0)
        cur = ans
        sum = 0
        
        while(True):
            if l1 != None:
                sum += l1.val
                l1 = l1.next
            if l2 != None:
                sum += l2.val
                l2 = l2.next
            
            cur.val = sum % 10
            sum = sum / 10
            
            if l1 != None or l2 != None or sum != 0:
                cur.next = ListNode(0)
                cur = cur.next
            else:
                break
                
        return ans