# 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
        """
        cur = None
        carry = 0
        sum = 0
        while l1 or l2 or carry:
            
            sums = carry
            if l1:
                sums += l1.val
                l1 = l1.next
            if l2:
                sums += l2.val
                l2 = l2.next
                
            if sums >= 10:
                carry = 1
                sums %=10
            else:
                carry = 0
            item = ListNode(sums)
            if cur == None:
                cur = item
            else:
                p = cur
                while p.next != None:
                    p = p.next
                p.next = item
            
        return cur

 

相关文章:

  • 2021-12-20
  • 2021-08-09
  • 2021-07-28
  • 2022-02-26
  • 2021-12-03
  • 2021-06-23
  • 2021-11-02
猜你喜欢
  • 2021-08-30
  • 2021-03-31
  • 2021-09-09
  • 2021-11-29
  • 2022-01-23
  • 2022-02-05
相关资源
相似解决方案