LeetCode 495. Teemo Attacking
来源:互联网 发布:python rqalpha 编辑:程序博客网 时间:2024/05/16 12:44
Description
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:
Input: [1,4], 2
Output: 4
**Explanation: **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.Input: [1,2], 2
**Output:**3
Explanation: 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.
Code
class Solution {public: int findPoisonedDuration(vector<int>& timeSeries, int duration) { int result = 0; if (timeSeries.size()==0) return 0; for (int i=1;i<timeSeries.size();i++) result += min(timeSeries[i]-timeSeries[i-1],duration); return result+duration; }};
Appendix
- Link: https://leetcode.com/problems/teemo-attacking/
- Run Time: 63ms
- The test case without any attack should be considered.
- 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 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】495. Teemo Attacking【M】【41】
- 【数组】Leetcode编程题解:495. Teemo Attacking
- 【LeetCode】495.Teemo Attacking解题报告
- [Leetcode] 495. Teemo Attacking 解题报告
- openssl命令详解
- Nuc
- ubuntu下c++11的支持问题
- JVM学习01-基本结构
- [算法练习]快速排序的C语言实现
- LeetCode 495. Teemo Attacking
- C语言中的scanf的使用
- 程序的机器级表示(IA32,AT&T,一)
- hashMap实现原理
- C/C++ #include<> 和 #include""的区别
- ubuntu 16.04 启用root用户方法
- Unity3D学习笔记(2)
- 面试题:实现在一个长度为255的数组,为数组中每一项填入1-255之间的数并且保证不重复
- 数据预处理索引