国产探花免费观看_亚洲丰满少妇自慰呻吟_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;}
發表評論 共有條評論
用戶名: 密碼:
驗證碼: 匿名發表
主站蜘蛛池模板: 来安县| 大余县| 滕州市| 竹溪县| 阿瓦提县| 马关县| 蓬溪县| 积石山| 宁陕县| 泸溪县| 朝阳区| 浏阳市| 蕉岭县| 嘉鱼县| 扶绥县| 锦屏县| 拉萨市| 建湖县| 会同县| 霍邱县| 南涧| 岳普湖县| 休宁县| 电白县| 南投市| 定南县| 印江| 肇东市| 靖西县| 焦作市| 潮安县| 溆浦县| 象山县| 油尖旺区| 萍乡市| 邯郸市| 宁明县| 错那县| 克什克腾旗| 海丰县| 宝兴县|