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

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

LeetCode題解:Teemo Attacking

2019-11-14 11:46:57
字體:
來源:轉載
供稿:網友

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;}
發表評論 共有條評論
用戶名: 密碼:
驗證碼: 匿名發表
主站蜘蛛池模板: 泰来县| 山阴县| 敦化市| 澄城县| 邢台县| 琼海市| 夹江县| 银川市| 凤阳县| 江津市| 渭源县| 青岛市| 和顺县| 杭锦旗| 定襄县| 白山市| 海伦市| 兰西县| 香格里拉县| 容城县| 西宁市| 郑州市| 东阳市| 阿瓦提县| 扶沟县| 南漳县| 吐鲁番市| 寻甸| 清河县| 二手房| 古交市| 盐山县| 富平县| 即墨市| 五家渠市| 安塞县| 中西区| 江都市| 巴塘县| 乳源| 广德县|