(Medium) Teemo Attacking - LeetCode

Description:

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], 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:

  1. You may assume the length of given time series array won't exceed 10000.
  2. 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.

 

Accepted
39.3K
Submissions
74.6K

Solution:

class Solution {
    public int findPoisonedDuration(int[] timeSeries, int duration) {  
        
        if(timeSeries ==null || timeSeries.length ==0){
            
            return 0;
        }
        
        int total = duration; 
        
        boolean awake = false;
        
        int wake_up_time = timeSeries[0]+duration;
        
        for(int i =1; i <timeSeries.length; i++){
            //System.out.println("check1 "+ i);
            
            if(wake_up_time<=timeSeries[i]){
                awake = true; 
            }   
            else{
                awake = false;
            }
            
           // System.out.println("Check2 "+ timeSeries[i]+" "+awake);
            
            if(awake){
            
                
                total = total +duration;
                
                wake_up_time = timeSeries[i]+duration;
            
                //System.out.println("Check3 "+ total+" "+ wake_up_time);
            }
            else{
                
                int tmp = timeSeries[i]+duration - wake_up_time; 
                
                total = total +tmp; 
                
                wake_up_time = timeSeries[i]+duration;
                //total = total +duration-(timeSeries[i]-timeSeries[i-1]);
            }
        }
        
        return total;
    }
}

 

转载于:https://www.cnblogs.com/codingyangmao/p/11460446.html

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值