[leetcode-495-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.

思路：

两种情况：

1,不存在覆盖，直接加上duration即可。

2,存在覆盖，则持续时间为相邻两个timeSeries之差。

int findPoisonedDuration(vector<int>& timeSeries, int duration)
     {
         int ret = 0;
         int n = timeSeries.size();
         if (n == 0)return 0;
         if (n == 1)return duration;

         for (int i = 0; i < n - 1; i++)
         {
             if (timeSeries[i] + duration > timeSeries[i + 1])//超过了
             {
                 ret = ret + timeSeries[i + 1] - timeSeries[i];
             }
             else
             {
                 ret += duration;
             }
         }
         ret += duration;
         return ret;
     }