Leetcode Add Two Numbers

最新推荐文章于 2022-04-02 19:47:08 发布

lauraliu123

最新推荐文章于 2022-04-02 19:47:08 发布

阅读量186

点赞数

分类专栏： Leetcode 文章标签： Leetcode Add Two Numbers

本文链接：https://blog.csdn.net/lauraliu123/article/details/80466878

版权

Leetcode 专栏收录该内容

6 篇文章 0 订阅

订阅专栏

Day2

懒得翻译了：0

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.

思路：

直接放代码吧

# 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
        """
        if l1 is None and l2 is None:
            return None
        cur = None
        first = None
carry = 0

#循环次数为l1，l2中较长的，同时对最后的进位进行一个是否大于10的判断和处理
while l1 is not None or l2 is not None or extra > 0:

   #如果l1或者l2中有一个到了末尾，则在之后的相加中换成0
            if l1 is None:
                l1_val = 0
            else:
                l1_val = l1.val
                l1 = l1.next
            if l2 is None:
                l2_val = 0
            else:
                l2_val = l2.val
                l2 = l2.next
            sum = l1_val + l2_val + carry
            if sum >= 10:
                digit = sum % 10
carry = sum // 10
            else:
                digit = sum
carry = 0
            temp = ListNode(digit)
            if cur is None:
                cur = temp
                first = cur
            else:
                cur.next = temp
                cur = cur.next

return first