题目大意：给你攻击的时间序列以及中毒的时长，求总共的中毒时间。
Problem:
https://leetcode.com/problems/teemo-attacking/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:
- 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.
Idea: Running Process
Compare the current attack time with the last one, if span is more than duration, add duration to total, otherwise add (curr – last).
C++
|
1 2 3 4 5 6 7 8 9 10 11 12 |
// Author: Huahua // Running time: 66 ms class Solution { public: int findPoisonedDuration(vector<int>& t, int duration) { if (t.empty()) return 0; int total = 0; for (int i = 1; i < t.size(); ++ i) total += (t[i] > t[i - 1] + duration ? duration : t[i] - t[i - 1]); return total + duration; } }; |
Java
|
1 2 3 4 5 6 7 8 9 10 11 |
// Author: Huahua // Running time: 9 ms class Solution { public int findPoisonedDuration(int[] t, int duration) { if (t.length == 0) return 0; int total = 0; for (int i = 1; i < t.length; ++ i) total += (t[i] > t[i - 1] + duration ? duration : t[i] - t[i - 1]); return total + duration; } } |
Python3
|
1 2 3 4 5 6 7 8 9 10 11 12 13 |
""" Author: Huahua Running time: 64 ms (beats 100%) """ class Solution: def findPoisonedDuration(self, timeSeries, duration): if not timeSeries: return 0 l = timeSeries[0] total = 0 for t in timeSeries: total += duration if t - l > duration else t - l l = t return total + duration |
|
1 2 3 4 5 6 7 |
import numpy as np class Solution: def findPoisonedDuration(self, timeSeries, duration): if not timeSeries: return 0 d = np.diff(timeSeries) d = np.clip(d, 0, duration) return int(np.sum(d) + duration) |
|
1 2 3 |
class Solution: def findPoisonedDuration(self, t, duration): return sum([min(c - l, duration) for l, c in zip(t, t[1:] + [1e9])]) |
