Leetcode 495. Teemo Attacking

最新推荐文章于 2025-12-17 23:41:09 发布

原创最新推荐文章于 2025-12-17 23:41:09 发布 · 212 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#leetcode

Leetcode 专栏收录该内容

409 篇文章

订阅专栏

本文介绍了如何解决LeetCode上的「提莫攻击」问题，提供了两种Python解决方案，Version1通过累加计算，Version2使用了更简洁的求最小值方式，详细解析了算法思路。

文章作者：Tyan
博客：noahsnail.com | 优快云 | 简书

1. Description

Teemo Attacking

2. Solution

**解析：**按顺序计算提莫的毒性伤害时间即可。

Version 1

class Solution:
    def findPoisonedDuration(self, timeSeries: List[int], duration: int) -> int:
        count = duration
        n = len(timeSeries)
        for i in range(n-1):
            if timeSeries[i] + duration <= timeSeries[i+1]:
                count += duration
            else:
                count += timeSeries[i+1] - timeSeries[i]
        return count

Version 2

class Solution:
    def findPoisonedDuration(self, timeSeries: List[int], duration: int) -> int:
        count = duration
        n = len(timeSeries)
        for i in range(n-1):
            count += min(duration, timeSeries[i+1] - timeSeries[i])
        return count