leetcode 2. Add Two Numbers Python3
Description
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:
Input: (2 -> 4 -> 3) + (5 -> 6 -> 4)
Output: 7 -> 0 -> 8
Explanation: 342 + 465 = 807.
问题分析
本题是一道中等题,意思是给定两个非空的链表,代表两个整数,其中低位在前,高位在后,计算两个整数的和,并将结果以链表的形式返回。
明白了题目的意思,就能知道这道题要考查的知识点了,这道题明显是考查对于链表的操作了,对于链表,最重要的就是考虑好特殊情况,一般都有哪些特殊情况呢,链表为空的时候,如何对链表第一个元素的操作、如何对链表最后一个元素操作,当有多条(>1)条链表的时候,一定要考虑链表不等长的情况,其他的就是根据题目的具体情况具体考虑了。
对于这道题而言,考查的就是两个链表不等长的情况,心中明白了这一点,就不会掉到坑里了。
代码实现
实现这道题的时候,我一共采用了两种方法,第一种如下:
# 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
"""
res = ListNode(0)
p = res
flag = 0
while l1 != None or l2 != None:
temp1 = 0
if l1 != None:
temp1 = l1.val
l1 = l1.next
temp2 = 0
if l2 != None:
temp2 = l2.val
l2 = l2.next
temp = temp1 + temp2 + flag
flag = temp // 10
temp = temp % 10
node = ListNode(temp)
p.next = node
p = node
if flag != 0:
temp = ListNode(flag)
p.next = temp
return res.next
第二种如下:
# 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
"""
res = ListNode(0)
p = res
flag = 0
while l1 != None and l2 != None:
temp = l1.val + l2.val + flag
flag = temp // 10
temp = temp % 10
node = ListNode(temp)
p.next = node
p = node
l1 = l1.next
l2 = l2.next
if l2 != None:
l1 = l2
while l1 != None:
temp = l1.val + flag
flag = temp // 10
temp = temp % 10
node = ListNode(temp)
p.next = node
p = node
l1 = l1.next
if flag != 0:
temp = ListNode(flag)
p.next = temp
return res.next
运行结果对比
从上图中可以看出,二者差距不大。
ok!大功告成了,如果你有其他的方法或者问题,欢迎在评论区交流。