leetcode第2题：链表相加

# Definition for singly-linked list.
# class ListNode(object):
#     def __init__(self, val=0, next=None):
#         self.val = val
#         self.next = next
class Solution(object):
    def addTwoNumbers(self, l1, l2):
        """
        :type l1: ListNode
        :type l2: ListNode
        :rtype: ListNode
        两种思路，要么扫两个链表，一位一位地加，要么直接将两个链表先转化为整数，然后再把和转成链表
        """
        def ListNode2Int(l_in):#todo 这个函数对了
            list_re=[]
            while l_in!=None:
                list_re.append(l_in.val)
                l_in=l_in.next
            int_q=0
            for i in list_re[::-1]:
                int_q=int_q*10+i
            return int_q
        sum_temp=ListNode2Int(l1)+ListNode2Int(l2)
        list_sum_temp=[]
        if sum_temp==0:
            list_sum_temp.append(0)
        else:
            while sum_temp>0: