lintcode/leetcode由易至难第19题:Teemo Attacking
来源:互联网 发布:网络社交软件盈利 编辑:程序博客网 时间:2024/06/15 05:31
Problem:
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.
Code:
public class Solution { public int findPoisonedDuration(int[] timeSeries, int duration) { if(timeSeries == null | timeSeries.length == 0){ //考虑两种特殊情况 return 0; } int l = timeSeries.length; int rst = duration; for(int i = 0; i < l - 1; i++){ if((timeSeries[i+1] - timeSeries[i]) < duration){ rst = rst + timeSeries[i+1] - timeSeries[i]; } else rst = rst + duration; //此处需要有else,因为必须二选一 } return rst; }}
阅读全文
0 0
- lintcode/leetcode由易至难第19题:Teemo Attacking
- 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
- IntelliJ IDEA2017 构建nwjs项目
- 最近两个月需要掌握的技术
- 单片机时钟程序(1)main.c
- PHP流封装协议
- 开发一个windows监控服务
- lintcode/leetcode由易至难第19题:Teemo Attacking
- Servlet-监听器获得当前在线人数
- hashMap学习总结
- XML基础
- jsp如何连接MySQL数据库
- Java中字符串中连续相同字符去重
- 剑指offer-翻转单词顺序
- 2017.6.26学习记录 java基础MyEclipse
- Hadoop分布式集群搭建