链表:两数之和

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

class Solution:
    def addTwoNumbers(self, l1, l2):
        dummy = p = ListNode(None)
        s = 0

        while l1 or l2 or s != 0:
            s += (l1.val if l1 else 0) + (l2.val if l2 else 0)
            p.next = ListNode(s % 10)
            p = p.next
            if l1: l1 = l1.next
            if l2: l2 = l2.next
            s = s // 10

        return dummy.next

 

上一篇:LeetCode算法第21题(合并两个有序链表)


下一篇:21-合并两个有序链表