leetcode #2

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

class Solution:
    def addTwoNumbers(self, l1, l2):
        l3=ListNode(0)
        h=ListNode(0)
        h.next=l3
        while l1!=None and l2!=None:
            tmp=ListNode(l1.val+l2.val)
            l3.next=tmp
            l3=l3.next
            l1=l1.next
            l2=l2.next
        if(l1!=None) :
            m=l1
            while(m.next!=None):
                m=m.next
            m.next=ListNode(0)
            l3.next=l1
        elif(l2!=None):
            m=l2
            while(m.next!=None):
                m=m.next
            m.next=ListNode(0)
            l3.next=l2
        else:
            l3.next=ListNode(0)
        flag=0
        last=None
        l3=h.next.next
        while l3!=None:
            if flag:
                l3.val+=1
                flag=0
            if l3.val>=10:
                l3.val%=10
                flag=1
            if(l3.next!=None and l3.next.val==0 and l3.next.next==None and flag==0):
                l3.next=None
                break
            
            l3=l3.next
        return h.next.next