题目链接:https://leetcode-cn.com/problems/teemo-attacking/
题目如下:
class Solution {
public:
int findPoisonedDuration(vector<int>& timeSeries, int duration) {
int result=0;
for(int i=0;i<timeSeries.size()-1;i++){
//判断相邻的两个时间间隔和持续时间的关系
if(timeSeries[i+1]-timeSeries[i]>=duration){
result+=duration;
}else{
result+=timeSeries[i+1]-timeSeries[i];
}
}
return result+duration;
}
};