(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

时间: 2024-11-09 00:44:55

(Medium) Teemo Attacking - LeetCode的相关文章

LeetCode 495. Teemo Attacking(medium)

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 outp

LeetCode &quot;Teemo Attacking&quot;

Isn't it 'Easy'? class Solution { public: int findPoisonedDuration(vector<int>& ts, int d) { int ret = 0, s = 0, e = 0; for(auto t : ts) { if(t > e) { ret += e - s; s = t; } e = t + d; } ret += e - s; return ret; } };

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 outp

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 outp

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 outp

[Swift]LeetCode495. 提莫攻击 | Teemo Attacking

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 outp

[LeetCode] Dota2 Senate 刀塔二参议院

In the world of Dota2, there are two parties: the Radiant and the Dire. The Dota2 senate consists of senators coming from two parties. Now the senate wants to make a decision about a change in the Dota2 game. The voting for this change is a round-bas

[LeetCode] Can Place Flowers 可以放置花

Suppose you have a long flowerbed in which some of the plots are planted and some are not. However, flowers cannot be planted in adjacent plots - they would compete for water and both would die. Given a flowerbed (represented as an array containing 0

LeetCode Problems List 题目汇总

No. Title Level Rate 1 Two Sum Medium 17.70% 2 Add Two Numbers Medium 21.10% 3 Longest Substring Without Repeating Characters Medium 20.60% 4 Median of Two Sorted Arrays Hard 17.40% 5 Longest Palindromic Substring Medium 20.70% 6 ZigZag Conversion Ea