You are given two linked lists representing two non-negative numbers. 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.
Input: (2 -> 4 -> 3) + (5 -> 6 -> 4)
Output: 7 -> 0 -> 8

# Leetcode：https://leetcode.com/problems/add-two-numbers/description/

# 结点类
class ListNode(object):
def __init__(self, x):
self.val = x
self.next = None

class Solution(object):
"""
:type l1: ListNode
:type l2: ListNode
:rtype: ListNode
"""
unit = 0   # 个位
listNode = ListNode(None) # 声明一个链表

# 依次遍历l1和l2
while l1 != None and l2 != None:
result = l1.val + l2.val + decade
unit = result%10
tempNode = ListNode(unit)
listNode.next = tempNode
l1 = l1.next
l2 = l2.next
listNode = listNode.next

while l1 != None:
unit = result%10
tempNode = ListNode(unit)
listNode.next = tempNode
l1 = l1.next
listNode = listNode.next

while l2 != None:
unit = result%10
tempNode = ListNode(unit)
listNode.next = tempNode
l2 = l2.next
listNode = listNode.next

# 可能存在长度相等，需要最后加一位1
# Input:
# 
# 
# Output:
# 
# Expected:
# [0,1]
return head.next 