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
题目来自: https://oj.leetcode.com/problems/add-two-numbers/
# Definition for singly-linked list.
# class ListNode:
# def __init__(self, x):
# self.val = x
# self.next = None
class Solution:
# @return a ListNode
def addTwoNumbers(self, l1, l2):
prev = None
val = 0
while l1 != None or l2 != None or val != 0:
if l1 is not None:
val += l1.val
l1 = l1.next
if l2 is not None:
val += l2.val
l2 = l2.next
curNode = ListNode(val%10)
val = 0 if val < 10 else 1
if prev is not None:
prev.next = curNode
else:
retList = curNode
prev = curNode
return retList
这道题目其实是很简单的,LeetCode 网站标注的难度是Medium.
就是考察链表使用,另外数字的相加进位,和链表长度不同是考察编码者是否细心。