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
思路:考虑和大于10时向后进位
Python:
# 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
"""
ret = ListNode(0)
cur = ret
add = 0
while (add != 0 or l1 != None or l2 != None):
if l1 != None:
add += l1.val
l1 = l1.next
if l2 != None:
add += l2.val
l2 = l2.next
cur.next = ListNode(add % 10)
cur = cur.next
add = add // 10
return ret.next