【LeetCode】495. Teemo Attacking

最新推荐文章于 2021-11-10 23:18:15 发布

墨染百城

最新推荐文章于 2021-11-10 23:18:15 发布

阅读量437

点赞数

分类专栏： LeetCode 文章标签： leetcode

本文链接：https://blog.csdn.net/mrbcy/article/details/64905831

版权

LeetCode 专栏收录该内容

41 篇文章 0 订阅

订阅专栏

问题描述

问题链接：https://leetcode.com/problems/teemo-attacking/#/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 1:

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.

Example 2:

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.

我的代码

思路很简单，直接上代码了。

public class Solution {
    public int findPoisonedDuration(int[] timeSeries, int duration) {
        /*
        思路就是遍历时间，然后用下一个时间减掉上一个时间，与duration比较，如果不够，就只能加上期间的那个时间了。
        */
        int len = timeSeries.length;
        int sum = 0;
        for(int i = 0; i < len; i++){
            if(i == len - 1 || timeSeries[i + 1] - timeSeries[i] >= duration){
                sum += duration;
            }else{
                sum += timeSeries[i + 1] - timeSeries[i];
            }
        }
        return sum;
    }
}

打败了28.11%的Java代码。来看看讨论区。

讨论区

Java 7 lines O(n) solution

思路一致。

public int findPoisonedDuration(int[] timeSeries, int duration) {
    if (timeSeries.length == 0) return 0;
    int begin = timeSeries[0], total = 0;
    for (int t : timeSeries) {
        total+= t < begin + duration ? t - begin : duration;
        begin = t;
    }   
    return total + duration;
}