Leetcode 问题是https://leetcode.com/problems/eliminate-maximum-number-of-monsters/ 我的代码如下:
class Solution(object):
def eliminateMaximum(self, dist, speed):
"""
:type dist: List[int]
:type speed: List[int]
:rtype: int
"""
mapped = []
killed = 0
for i, v in enumerate(zip(dist, speed)):
mapped.append([v[0]/v[1], v[0], v[1]])
mapped.sort(key=lambda x: x[0])
iterator = iter(mapped)
while True:
try:
next(iterator)[1] = -1
killed += 1
except StopIteration:
return killed
for v in mapped[killed:]:
v[1] = v[1]-v[2]
if v[1] <= 0:
return killed
sol = Solution()
r = sol.eliminateMaximum([4,8,6,8,2,7,4], [1,3,3,1,10,1,1])
print(r)
我的输出是预期的 4,但是 leetcode 得到 2 并告诉我这是一个错误的答案。