leetcode 495. Teemo Attacking

来源:互联网 发布:java io读取文件乱码 编辑:程序博客网 时间:2024/05/16 01:20

原题:

In LOL 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.
写个lt也有lol的事情,

思路:就算算一下爱希的中毒事件,直接顺序算下来就好。

代码如下:

int findPoisonedDuration(int* timeSeries, int timeSeriesSize, int duration) {    int sum=0;    if(timeSeriesSize==0)        return sum;    if(timeSeriesSize==1)        return duration;    for(int n=1;n<timeSeriesSize;n++)    {        if(*(timeSeries+n)>(*(timeSeries+n-1)+duration))        {            sum=sum+duration;        }        else        {            sum=sum+*(timeSeries+n)-*(timeSeries+n-1);        }    }    return sum+duration;}

PS:有没有玩lol,我是电一的。。。有的话私信我一起上铂金?

原创粉丝点击