LeetCode: Teemo Attacking
来源:互联网 发布:淘宝交易金额冻结 编辑:程序博客网 时间:2024/06/05 20:18
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.
Example 1:
Input: [1,4], 2Output: 4Explanation: At time point 1, Teemo starts attacking Ashe and makes Ashe be poisoned immediately.
This poisoned status will last 2 seconds until the end of time point 2.
And at time point 4, Teemo attacks Ashe again, and causes Ashe to be in poisoned status for another 2 seconds.
So you finally need to output 4.
Example 2:
Input: [1,2], 2Output: 3Explanation: At time point 1, Teemo starts attacking Ashe and makes Ashe be poisoned.
This poisoned status will last 2 seconds until the end of time point 2.
However, at the beginning of time point 2, Teemo attacks Ashe again who is already in poisoned status.
Since the poisoned status won't add up together, though the second poisoning attack will still work at time point 2, it will stop at the end of time point 3.
So you finally need to output 3.
Note:
- You may assume the length of given time series array won't exceed 10000.
- You may assume the numbers in the Teemo's attacking time series and his poisoning time duration per attacking are non-negative integers, which won't exceed 10,000,000.
解析:每次记录上次有效期和当前时间的关系,即可
class Solution {public: int findPoisonedDuration(vector<int>& timeSeries, int duration) { if (timeSeries.size() == 0) return 0; int total_time = 0; int end_time = timeSeries[0]; for (int i = 0; i < timeSeries.size(); ++i) { if (timeSeries[i] > end_time) { total_time += duration; end_time = timeSeries[i] + duration; } else if (timeSeries[i] + duration > end_time) { total_time += timeSeries[i] + duration - end_time; end_time = timeSeries[i] + duration; } } return total_time; }};
1 0
- LeetCode题解:Teemo Attacking
- LeetCode 495. Teemo Attacking
- LeetCode: Teemo Attacking
- LeetCode 495. Teemo Attacking
- LeetCode 495 --- Teemo Attacking
- LeetCode:495. Teemo Attacking
- 【Leetcode】495. Teemo Attacking
- Leetcode 495 Teemo Attacking
- LeetCode 495 Teemo Attacking
- [leetcode] 495. Teemo Attacking
- LeetCode|Array|Teemo Attacking
- leetcode 495. Teemo Attacking
- 【LeetCode】495. Teemo Attacking
- LeetCode 495. Teemo Attacking
- LeetCode 495. Teemo Attacking
- leetcode 495. Teemo Attacking
- leetcode 495. Teemo Attacking
- [Leetcode 495] Teemo Attacking
- C/C++ console程序隐藏console黑窗口
- 数据加签加密
- 小白笔记----------- 执行 hadoop checknative 报错 openssl: false Cannot load libcrypto.so
- Angular 2 – 提升水平的最佳实践
- docker UFT-8乱码问题
- LeetCode: Teemo Attacking
- python遍历本地文件系统
- iOS中self的定义
- MYSQL部分知识点
- PAT.Basic level.T.1008.数组元素右移
- HBase Rowkey设计
- 深入理解享元模式
- java8系列之方法引用
- PHP可逆加密解密算法