LeetCode-495. Teemo Attacking

最新推荐文章于 2024-12-14 07:15:00 发布

原创最新推荐文章于 2024-12-14 07:15:00 发布 · 221 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#LeetCode #string

LeetCode-C++ 专栏收录该内容

35 篇文章

订阅专栏

本文介绍了一种基于提莫攻击序列计算总中毒时间的算法。通过处理特定的时间序列和中毒持续时间，有效地计算出敌人阿什处于中毒状态的总时间。文章提供了具体的实现思路和示例代码。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

In LOL world, there is a hero called Teemo and his attacking can make his enemy Ashe be in poisoned condition. Now, given the Teemo's attacking ascending time series towards Ashe and the poisoning time duration per Teemo's attacking, you need to output the total time that Ashe is in poisoned condition.

You may assume that Teemo attacks at the very beginning of a specific time point, and makes Ashe be in poisoned condition immediately.

Example 1:

Input: [1,4], 2
Output: 4
Explanation: At time point 1, Teemo starts attacking Ashe and makes Ashe be poisoned immediately. 
This poisoned status will last 2 seconds until the end of time point 2. 
And at time point 4, Teemo attacks Ashe again, and causes Ashe to be in poisoned status for another 2 seconds. 
So you finally need to output 4.

Example 2:

Input: [1,2], 2
Output: 3
Explanation: At time point 1, Teemo starts attacking Ashe and makes Ashe be poisoned. 
This poisoned status will last 2 seconds until the end of time point 2. 
However, at the beginning of time point 2, Teemo attacks Ashe again who is already in poisoned status. 
Since the poisoned status won't add up together, though the second poisoning attack will still work at time point 2, it will stop at the end of time point 3. 
So you finally need to output 3.

Note:

You may assume the length of given time series array won't exceed 10000.
You may assume the numbers in the Teemo's attacking time series and his poisoning time duration per attacking are non-negative integers, which won't exceed 10,000,000.

题目：提莫攻击，给一个攻击的时间序列，给定一个受到攻击时的中毒时间。求最后总的中毒时间

思路：先处理时间序列为0的情况；扫描时间序列，如果后一个时间与前一个时间跨度大于duration，则total_time加上duration即可，若果小于duration，则加上跨度，并更新flag继续扫描。

代码：

class Solution {
public:
    int findPoisonedDuration(vector<int>& timeSeries, int duration) {
        int total_time=0;
        int flag = 0;
        if(timeSeries.size()==0)//如果序列为空
            return total_time;
        for(int i=1;i<timeSeries.size();i++){
        	if(timeSeries[i]-timeSeries[flag]>=duration) //跨度大于duration
        		total_time += duration;
        	else
				total_time += timeSeries[i]-timeSeries[flag];//跨度小于duration
			flag = i;
		}
		return total_time + duration;//扫描到最后一个点，最后一个点往后还有duration的中毒时间
    }
};

AC，beats 98%