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

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

LeetCode題解:Teemo Attacking

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

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;}
上一篇:關于友元函數

下一篇:文章標題

發表評論 共有條評論
用戶名: 密碼:
驗證碼: 匿名發表
主站蜘蛛池模板: 西宁市| 买车| 鄂温| 金门县| 五大连池市| 合山市| 大石桥市| 贡山| 洪湖市| 家居| 河北省| 明光市| 绥化市| 惠东县| 上蔡县| 老河口市| 宜宾市| 济源市| 林甸县| 南和县| 德保县| 南乐县| 大同市| 莱阳市| 鹿泉市| 离岛区| 胶州市| 曲水县| 章丘市| 香格里拉县| 恩施市| 彰武县| 夏津县| 虎林市| 栾川县| 元阳县| 阿鲁科尔沁旗| 磐石市| 兴宁市| 团风县| 汝城县|