1 Star 0 Fork 0

yuhang2__2/LeetCode-Solutions

加入 Gitee
与超过 1200万 开发者一起发现、参与优秀开源项目,私有仓库也完全免费 :)
免费加入
文件
克隆/下载
add-two-polynomials-represented-as-linked-lists.py 940 Bytes
一键复制 编辑 原始数据 按行查看 历史
# Time: O(m + n)
# Space: O(1)
class PolyNode:
def __init__(self, x=0, y=0, next=None):
pass
class Solution:
def addPoly(self, poly1, poly2):
"""
:type poly1: PolyNode
:type poly2: PolyNode
:rtype: PolyNode
"""
curr = dummy = PolyNode()
while poly1 and poly2:
if poly1.power > poly2.power:
curr.next = poly1
curr = curr.next
poly1 = poly1.next
elif poly1.power < poly2.power:
curr.next = poly2
curr = curr.next
poly2 = poly2.next
else:
coef = poly1.coefficient+poly2.coefficient
if coef:
curr.next = PolyNode(coef, poly1.power)
curr = curr.next
poly1, poly2 = poly1.next, poly2.next
curr.next = poly1 or poly2
return dummy.next
Loading...
马建仓 AI 助手
尝试更多
代码解读
代码找茬
代码优化
1
https://gitee.com/yuhang2__2/LeetCode-Solutions.git
git@gitee.com:yuhang2__2/LeetCode-Solutions.git
yuhang2__2
LeetCode-Solutions
LeetCode-Solutions
master

搜索帮助