力扣：每天两道题~~

力扣：每天2道题

希望自己能坚持下去
2020.10.13

1. easy：过
2. 两数相加，emm，对比发现自己的差距，要求自己默一遍人家的代码。
3. 两点注意：
   1. return的是.next
   2. l1 = l1.next if l1 else None # 如果l1存在, 则向后遍历, 否则为 None
      l2 = l2.next if l2 else None # 如果l2存在, 则向后遍历, 否则为 None

class Solution(object):
    def addTwoNumbers(self, l1, l2):
        """
        :type l1: ListNode
        :type l2: ListNode
        :rtype: ListNode
        """
        r = l = ListNode()
        if l1 != None and l2 != None:
            if l1.val + l2.val < 10:
                n = ListNode(l1.val + l2.val)
                l.next = n
                l = l.next
            else:
                n = ListNode(l1.val + l2.val-10)
                l.next = n
                l = l.next
                if l1.next != None:
                    l1.next.val += 1
                elif l2.next != None:
                    l2.next.val += 1
                else:
                    ln = ListNode(1)
                    l1.next = ln
            l1 = l1.next
            l2 = l2.next


        while l1 != None and l2 != None:
            if l1.val + l2.val < 10:
                n = ListNode(l1.val + l2.val)
                l.next = n
                l = l.next
            else:
                n = ListNode(l1.val + l2.val-10)
                l.next = n
                l = l.next
                if l1.next != None:
                    l1.next.val += 1
                elif l2.next != None:
                    l2.next.val += 1
                else:
                    ln = ListNode(1)
                    l1.next = ln
            l1 = l1.next
            l2 = l2.next
        while l1 != None:
            if l1.val <10:
                n = ListNode(l1.val)
            else:
                n = ListNode(l1.val - 10)
                if l1.next != None:
                    l1.next.val += 1
                else:
                    ln = ListNode(1)
                    l1.next = ln
            l.next = n
            l = l.next
            l1 = l1.next
        while l2 != None:
            if l2.val <10:
                n = ListNode(l2.val)
            else:
                n = ListNode(l2.val - 10)
                if l2.next != None:
                    l2.next.val += 1
                else:
                    ln = ListNode(1)
                    l2.next = ln
            l.next = n
            l = l.next
            l2 = l2.next
        return r.next
        
class Solution:
    def addTwoNumbers(self,l1,l2):
        # 创建一个结点值为 None 的头结点, dummy 和 p 指向头结点, dummy 用来最后返回, p 用来遍历
        dummy = p = ListNode(None)          
        s = 0               # 初始化进位 s 为 0
        while l1 or l2 or s:
            # 如果 l1 或 l2 存在, 则取l1的值 + l2的值 + s(s初始为0, 如果下面有进位1, 下次加上)
            s += (l1.val if l1 else 0) + (l2.val if l2 else 0)  
            p.next = ListNode(s % 10)       # p.next 指向新链表, 用来创建一个新的链表
            p = p.next                      # p 向后遍历
            s //= 10                        # 有进位情况则取模, eg. s = 18, 18 // 10 = 1
            l1 = l1.next if l1 else None    # 如果l1存在, 则向后遍历, 否则为 None
            l2 = l2.next if l2 else None    # 如果l2存在, 则向后遍历, 否则为 None
        return dummy.next   # 返回 dummy 的下一个节点, 因为 dummy 指向的是空的头结点, 下一个节点才是新建链表的后序节点