Leetcode 495. 提莫攻击 模拟题目

第一版代码:

class Solution {
public:
    int findPoisonedDuration(vector<int>& timeSeries, int duration) {
        int n = timeSeries.size();
        if(n==0) return 0;
        int res = 0, endTime = timeSeries[0] + duration;
        for(int i=1;i<n;i++){
            if(timeSeries[i]>endTime){
                res += duration;               // 攻击之前已解读,吃满
            }else{                             // 攻击之前未解毒,清CD,重新计算
                res += timeSeries[i] - timeSeries[i-1];
            }
            endTime = timeSeries[i] + duration;
        }
        res+= duration;                       // 最后一次吃满
        return res;
    }
};

优化代码
 

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

 


版权声明:本文为wwxy1995原创文章,遵循CC 4.0 BY-SA版权协议,转载请附上原文出处链接和本声明。