[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.
Example:
代码语言：javascript复制Input: (2 -> 4 -> 3) (5 -> 6 -> 4)
Output: 7 -> 0 -> 8
Explanation: 342 465 = 807.Solution：
代码语言：javascript复制# 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
"""
tmp=ListNode(0)
res=tmp
flag=0
while l1!=None or l2!=None:
tt=0
if l1!=None:
tt =l1.val
l1=l1.next
if l2!=None:
tt =l2.val
l2=l2.next
res.next=ListNode((tt flag))
flag=(tt flag)//10
res=res.next
if flag:
res.next=ListNode(1)
res=tmp.next
return res
