算法设计与应用基础作业(三)
来源:互联网 发布:网络电话卡怎么使用 编辑:程序博客网 时间:2024/06/05 00:51
题目地址:点击打开链接
题目描述:
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 attackingascending 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) { int time=duration; if(timeSeries.size()==0)return 0;//如果vector空,返回0 if(timeSeries.size()==1)return duration;//如果vector只有一个值,返回duration for(int i=0;i<timeSeries.size()-1;i++){ if(timeSeries[i+1]-timeSeries[i]>=duration){ time+=duration; } else{ time+=timeSeries[i+1]-timeSeries[i]; } } return time; }};
0 0
- 算法设计与应用基础作业(三)
- 算法设计与应用基础作业(一)
- 算法设计与应用基础作业(二)
- 算法设计与应用基础作业第二周
- 算法设计与应用基础作业第一周
- 算法设计与应用基础作业第三周
- 算法设计与应用基础作业第四周
- 算法设计与应用基础:NP完全问题作业
- 算法设计与应用基础
- 算法设计与应用基础
- 算法设计与应用基础
- 算法设计与应用基础
- 算法设计与应用基础
- 算法设计与应用基础
- 算法设计与应用基础
- 算法设计与应用基础
- 算法设计与应用基础
- 算法设计与应用基础
- 设计模式笔记四:建造者模式
- Angular 2 原生国际化支持(一)
- 第八周总结
- 安卓漫漫路之AIDL传递简单数据.
- Android Studio之Gradle版本配置
- 算法设计与应用基础作业(三)
- 关于Tree的dataurl的值的获取
- Ubuntu使用root帐号,并让Xshell, Winscp以root身份登录
- POJ 1845 Sumdiv 二分+因式分解
- 1028. List Sorting
- linux下搭建redis单机版+java连接测试
- you-get视频采集
- 数据结构-队列
- [Java开发] jdk环境搭建+eclipse字体基本设置