• 495. Teemo Attacking


    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.

    My Solution:

    public class Solution {
        public int findPoisonedDuration(int[] timeSeries, int duration) {
            int count = duration;
            if(timeSeries.length == 0) return 0;
            
            for(int i = 1 ; i < timeSeries.length ; i++){
                if(timeSeries[i]-timeSeries[i-1]>=duration){
                    count += duration;
                }else{
                    count += timeSeries[i]-timeSeries[i-1];
                }
            }
            
            return count;
        }
    }

    Others' 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;
        } 
  • 相关阅读:
    schema约束和引入
    第一天
    github pages搭建网站(三)
    git安装和使用(二)
    使用github(一)
    命名实体识别总结
    约瑟夫环
    标准化和归一化
    cumsum累计函数系列:pd.cumsum()、pd.cumprod()、pd.cummax()、pd.cummin()
    pandas处理时间序列(4): 移动窗口函数
  • 原文地址:https://www.cnblogs.com/luojunc/p/6428054.html
Copyright © 2020-2023  润新知