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.
在LLP世界中，有个叫提莫的英雄，他的攻击可以使得他的敌人艾希处于中毒状态。现在给定提莫的攻击时间点序列（升序）和艾希的中毒持续时间，要求输出艾希的总共中毒持续时间。
你可假定提莫的攻击在时间点一开始就发动，且中毒效果即可发作。

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. 可假定输入时间序列不会超过10000.
2. 可假定攻击时间和中毒持续时间均为非负整数，且不超过10,000,000.

思路：

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

public class Solution {
    public int findPoisonedDuration(int[] timeSeries, int duration) {
        if(timeSeries.length==0) return 0;
        if(timeSeries.length==1) return duration;
        int res=0;
        for(int i=1;i<timeSeries.length;i++){
            int timing=timeSeries[i]-timeSeries[i-1];
            res+=((timing<duration)?timing:duration);
        }
        return res+duration;
    }
}

class Solution(object):
    def findPoisonedDuration(self, timeSeries, duration):
        """
        :type timeSeries: List[int]
        :type duration: int
        :rtype: int
        """
        res=duration*(len(timeSeries))
        for i in range(1,len(timeSeries)):
            res-=max(0,duration-(timeSeries[i]-timeSeries[i-1]))
        return res;