国产探花免费观看_亚洲丰满少妇自慰呻吟_97日韩有码在线_资源在线日韩欧美_一区二区精品毛片,辰东完美世界有声小说,欢乐颂第一季,yy玄幻小说排行榜完本

首頁 > 學院 > 開發設計 > 正文

LeetCode題解:Teemo Attacking

2019-11-14 10:22:33
字體:
來源:轉載
供稿:網友

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.

思路:首先假定所有時間下的攻擊都帶來完全的中毒,之后再把重復的地方去掉。題解:
int findPoisonedDuration(const std::vector<int>& timeSeries, int duration) {    int accumulated = duration * timeSeries.size();    int lastAttackEnd = std::numeric_limits<int>::min();    for(auto time: timeSeries) {        if (lastAttackEnd > time) {            accumulated -= lastAttackEnd - time;        }        lastAttackEnd = time + duration;    }    return accumulated;}
發表評論 共有條評論
用戶名: 密碼:
驗證碼: 匿名發表
主站蜘蛛池模板: 绥德县| 曲阜市| 观塘区| 金华市| 湖北省| 辽阳市| 宁都县| 彩票| 尉犁县| 台东县| 苗栗市| 和静县| 荔浦县| 梧州市| 登封市| 上林县| 荔波县| 大悟县| 抚顺县| 甘孜| 屯门区| 金堂县| 大兴区| 华容县| 扬中市| 永年县| 平阴县| 长顺县| 武清区| 红桥区| 延庆县| 吴堡县| 冕宁县| 定兴县| 房产| 道孚县| 澎湖县| 新化县| 西昌市| 米泉市| 大田县|