标签：
本题是使得两个链表相加，每个链表中值均为0~9，对于两个链表对应的值相加值sum若大于9，则为sum%10，并在指向的下一对节点的和sum上加1。
做题思路：
语法细节：
代码实现：
class ListNode: def __init__(self, x): self.val = x self.next = None class Solution: # @return a ListNode def addTwoNumbers(self, l1, l2): if l1 is None: return l2 elif l2 is None: return l1 else: carry = 0 ret =ListNode(0) ret_Last = ret while(l1 or l2): sum = 0 if(l1): sum = l1.val l1 = l1.next if(l2): sum += l2.val l2 = l2.next sum += carry ret_Last.next = ListNode(sum%10) ret_Last = ret_Last.next carry = (sum >= 10) if(carry): ret_Last.next =ListNode(1) ret_Last = ret.next del ret return ret_Last
[Leetcode] Add Two Numbers @Python
标签：
原文地址：http://www.cnblogs.com/tosouth/p/4268398.html
