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:

最近少刷题了，但是感觉还是刷题最有意思，这学期要学数据库，感觉有点枯燥乏味，其余的大数据的课也显得水水的，希望后面部分能够有所收获。

刷题还是要继续，不过应该不会更新的很频繁。目前遇到的基本上都是之前不太会的题。是时候复习一波拿不太准的题目了。另外吐槽下leetcode涨题的速度真的是太快了。

这道题就是数组题

代码：

public int findPoisonedDuration(int[] timeSeries, int duration) {
        int count = 0;
        if(timeSeries == null || timeSeries.length == 0) return count;
        for(int i=0;i<timeSeries.length-1;i++){
            if(timeSeries[i]+duration<timeSeries[i+1]){
                count+= duration;
            }else{
                count += timeSeries[i+1]-timeSeries[i];
            }
        }
        count+= duration;
        return count;
    }