Leetcode 2. Add Two Numbers

最近在学习python，写点小的算法熟悉下语言

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(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
        """
        l3 = ListNode(0)
        head = ListNode(0)
        l3 = head
        flag = 0
        while l1 or l2 or flag:
            head.next = ListNode(0)
            head = head.next
            if l1 :
                a = l1.val
            else:
                a = 0
            if l2 :
                b = l2.val
            else:
                b = 0
            sum = a + b + flag
            flag = int(sum / 10)
            head.val = sum % 10
            if l1 :
                l1 = l1.next

            if l2 :
                l2 = l2.next

        return l3.next