代码拉取完成,页面将自动刷新
# 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
此处可能存在不合适展示的内容,页面不予展示。您可通过相关编辑功能自查并修改。
如您确认内容无涉及 不当用语 / 纯广告导流 / 暴力 / 低俗色情 / 侵权 / 盗版 / 虚假 / 无价值内容或违法国家有关法律法规的内容,可点击提交进行申诉,我们将尽快为您处理。