LeetCode|Array|Teemo Attacking

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.

解析：这道题题目我看了良久。。就是给一个数组和一个数，这个数组里面的元素代码攻击的时间点，另外一个数表示攻击后毒持续的时间，让你求总共毒持续的时间。这道题我原本想先建一个数组，然后赋特征值，但是不知道应该建多大的数组，所以就放弃了这个想法。后来一想其实自己原本的想法还比较复杂，直接用for循环和if判断语句其实就可以轻松解决。我的代码有 if(len>=1) t+=duration;这样一行。因为有一个坑可能容易忽视，就是数组里面没有元素，这点需要考虑进去的。

源代码如下：

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