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

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

LeetCode題解:Teemo Attacking

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

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;}
發表評論 共有條評論
用戶名: 密碼:
驗證碼: 匿名發表
主站蜘蛛池模板: 卫辉市| 武平县| 绵竹市| 景谷| 上栗县| 禹城市| 锡林郭勒盟| 扶风县| 龙海市| 绥宁县| 邯郸县| 林甸县| 阳高县| 搜索| 淳化县| 万载县| 南和县| 德保县| 沛县| 纳雍县| 沿河| 定日县| 克山县| 奇台县| 泽普县| 西乌| 新民市| 黄石市| 重庆市| 文安县| 怀仁县| 祥云县| 安乡县| 黄骅市| 镇巴县| 阜新市| 双辽市| 浦江县| 友谊县| 太原市| 和田县|