Leetcode问题：https://leetcode.com/problems/eliminate-maximum-number-of-monsters/
我的Python解决方案如下：

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)

Python控制台的输出是4（如预期的那样），但Leetcode的输出是2，这是错误的答案。