495. Teemo Attacking （C++）

题目：

In LLP 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:

1.You may assume the length of given time series array won’t exceed 10000.
2.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.

翻译：

例1：

输入：[1,4]，2
输出：4
说明：在时间点1，Teemo开始攻击Ashe，并立即使Ashe中毒。
此中毒状态将持续2秒，直到时间点2结束。
在时间点4，Teemo再次攻击Ashe，并导致Ashe在中毒状态下再持续2秒。
所以你终于需要输出4。

例2：

输入：[1,2]，2
输出：3
说明：在时间点1，Teemo开始攻击Ashe，并使Ashe中毒。
此中毒状态将持续2秒，直到时间点2结束。
然而，在时间点2的开始，Teemo再次攻击Ashe谁已经在中毒状态。
由于中毒状态不会一起累加，虽然第二中毒攻击在时间点2仍然工作，它将在时间点3结束时停止。
所以你终于需要输出3。

思路：

所有时间加一遍，然后减去重叠时间。
不要忘了0输入情况。
数学上0是很特殊的，一定要注意。

解答：

下面给出我的答案：（max88.77%）

class Solution {
public:
    int findPoisonedDuration(vector<int>& timeSeries, int duration) {
        int s = 0;
        int l = timeSeries.size();
        if (l == 0)
            return s;
        for (int i = 0; i < l - 1; i++)
        {
            int a = timeSeries[i] + duration - timeSeries[i + 1];
            s += duration;
            if (a > 0)
            {
                s -= a;
            }
        }
        return s + duration;
    }
};

ps：一定会有比这个简单的多的答案。这个思考太简单了