495. Teemo Attacking
来源:互联网 发布:input onchange php 编辑:程序博客网 时间:2024/05/15 10:27
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.
Subscribe to see which companies asked this question.
public class Solution { public int findPoisonedDuration(int[] timeSeries, int duration) { if(timeSeries.length==0) return 0; int re=0; for(int i=0;i<timeSeries.length-1;++i){ if(timeSeries[i+1]-timeSeries[i]>duration) re+=duration; else re+=(timeSeries[i+1]-timeSeries[i]); } return re+duration; }}
0 0
- 495. Teemo Attacking
- LeetCode 495. Teemo Attacking
- LeetCode 495. Teemo Attacking
- 495. Teemo Attacking
- 495. Teemo Attacking
- 495. Teemo Attacking
- LeetCode:495. Teemo Attacking
- 【Leetcode】495. Teemo Attacking
- 495. Teemo Attacking
- [Array]495. Teemo Attacking
- 495. Teemo Attacking
- [leetcode] 495. Teemo Attacking
- 495. Teemo Attacking
- 495. Teemo Attacking
- leetcode 495. Teemo Attacking
- 【LeetCode】495. Teemo Attacking
- LeetCode 495. Teemo Attacking
- 495. Teemo Attacking
- HTML复习
- zynq-7000系列解决部分用户反映MAC地址每次启动都变化的问题
- 【WCF】WCF框架学习
- mysql常用命令
- 三星手机S8曝光或再掀购机热潮
- 495. Teemo Attacking
- 解决android 64K
- unit2 JAVA程序开发
- CART分类与回归树
- matlab figute窗口如何 保存的高分辨率图像
- LeNet5训练Mnist回顾总结
- Python程序打包--pyinstaller库的使用
- 生成唯一的订单号
- 给出一个包含 0 .. N 中 N 个数的序列,找出0 .. N 中没有出现在序列中的那个数。