Add Two Numbers

Description
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.
Input: (2 -> 4 -> 3) + (5 -> 6 -> 4)
Output: 7 -> 0 -> 8

# Definition for singly-linked list.
# class ListNode:
#     def __init__(self, x):
#         self.val = x
#         self.next = None
class Solution:
    def addTwoNumbers(self, l1, l2):
        """
        :type l1: ListNode
        :type l2: ListNode
        :rtype: ListNode
        """
        p = l1
        q = l2
        h = ListNode(0)
        t = h
        carry = 0
        while(p != None and q != None):
            s = ListNode(0)
            s.val = (carry + p.val + q.val)%10
            carry = int((carry + p.val + q.val)/10)
            t.next = s
            t = s
            p = p.next
            q = q.next
        while(p != None):
            s = ListNode(0)
            s.val = (carry + p.val)%10
            carry = int((carry + p.val)/10)
            t.next = s
            t = s
            p = p.next
        while(q != None):
            s = ListNode(0)
            s.val = (carry + q.val)%10
            carry = int((carry + q.val)/10)
            t.next = s
            t = s
            q = q.next
        if carry > 0:
            t.next = ListNode(carry)
        return h.next