Leetcode——495. Teemo Attacking

题目原址

https://leetcode.com/problems/teemo-attacking/description/

题目描述

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.

Example1：

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.

Example2：

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.

题目翻译：

在LOL的世界里，有一个名叫Teemo的英雄，他的攻击可以让他的敌人Ashe陷入中毒的状态。现在，我们将给出Teemo对Ashe发起进攻的时间点的升序序列，以及每次攻击后Ashe中毒状态持续的时间，你需要输出Ashe处于中毒状态的时间综合。

假设Teemo的攻击发起在每个时间点的最开始，并且在发起攻击时便立即使得Ashe陷入中毒状态。

这个题还是比较好解的

• 首先要判断给定的数组是否为空，如果为空，则说明teemo没有攻击，所以返回0
• 将给定的数组的后项-前项，得到的结果存在另一个数组array中
  
  • 如果array中的元素有值小于duration的，说明Teemo两次进攻的时间相离很近，还没有等当这次的毒解除就中了下一次毒，所以中毒的时间为两次攻击的时间差+中毒一次的时间。
  • 如果array中的元素有值大于duration，说明Teemo两次进攻的时间离得远，上一次中毒解除后，Teemo才发起下一次进攻，则中毒时间为2倍的duration。

AC代码

class Solution {
    public int findPoisonedDuration(int[] timeSeries, int duration) {
        int ret = 0;
        if(timeSeries.length == 0)
            return 0;
        int[] array = new int[timeSeries.length];
        for(int i = 1; i < timeSeries.length; i++) {
            array[i - 1] = timeSeries[i] - timeSeries[i - 1];
            if(array[i - 1] < duration) {
                ret += array[i - 1];
            }else {
                ret += duration;
            }
        }
        return ret + duration;        
    }
}