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.

Difficulty: MEDIUM_HARD
Tags: Data structures
Skill types: Data structures

Starter code:
class Solution:
    def findPoisonedDuration(self, timeSeries: List[int], duration: int) -> int:
        

Solutions:
class Solution:

	def findPoisonedDuration(self, timeSeries, duration):
		if not timeSeries:
			return 0
		prev = timeSeries[0]
		ret = 0
		count = 0
		for t in timeSeries[1:]:
			diff = t - prev
			if diff > duration:
				count += 1
			else:
				ret += diff
			prev = t
		ret += (count + 1) * duration
		return ret


class Solution:

	def findPoisonedDuration(self, timeSeries, duration):
		if not timeSeries:
			return 0
		previous_time = timeSeries[0]
		total_time = duration
		for time in timeSeries[1:]:
			if time - previous_time < duration:
				total_time += time - previous_time
				previous_time = time
			else:
				total_time += duration
				previous_time = time
		return total_time


class Solution:

	def findPoisonedDuration(self, timeSeries, duration):
		res = 0
		if timeSeries == []:
			return 0
		last = timeSeries[0]
		cur = timeSeries[0]
		for i in range(1, len(timeSeries)):
			if timeSeries[i] - cur < duration:
				cur = timeSeries[i]
				continue
			else:
				res += cur - last + duration
				last = timeSeries[i]
				cur = timeSeries[i]
		res += cur - last + duration
		return res


class Solution:

	def findPoisonedDuration(self, timeSeries, duration):
		total = 0
		last = float('-inf')
		for t in timeSeries:
			total += duration
			if last + duration > t:
				total -= last + duration - t
			last = t
		return total


class Solution:

	def findPoisonedDuration(self, timeSeries, duration):
		totalBlind = 0
		lastBlindEnd = 0
		ts = sorted(timeSeries)
		for time in ts:
			if time < lastBlindEnd:
				totalBlind += time + duration - lastBlindEnd
			else:
				totalBlind += duration
			lastBlindEnd = time + duration
		return totalBlind


class Solution:

	def findPoisonedDuration(self, timeSeries, duration):
		if not timeSeries:
			return 0
		length = len(timeSeries)
		if length == 1:
			return duration
		result = duration
		(start_time, end_time) = (timeSeries[0], timeSeries[0] + duration - 1)
		for t in timeSeries[1:]:
			if t <= end_time:
				result += t + duration - 1 - end_time
				end_time = t + duration - 1
			else:
				result += duration
				(start_time, end_time) = (t, t + duration - 1)
		return result


class Solution:

	def findPoisonedDuration(self, timeSeries, duration):
		return sum((min(duration, b - a) for (a, b) in zip(timeSeries, timeSeries[1:] + [100000000.0])))


class Solution:

	def findPoisonedDuration(self, timeSeries, duration):
		if not timeSeries:
			return 0
		total_poisoned_time = 0
		for i in range(len(timeSeries) - 1):
			if timeSeries[i + 1] <= timeSeries[i] + duration:
				total_poisoned_time += timeSeries[i + 1] - timeSeries[i]
			else:
				total_poisoned_time += duration
		total_poisoned_time += duration
		return total_poisoned_time


class Solution:

	def findPoisonedDuration(self, timeSeries, duration):
		l = len(timeSeries)
		if l == 0:
			return 0
		if l == 1:
			return duration
		T = 0
		i = 1
		while i < l:
			if timeSeries[i] - timeSeries[i - 1] >= duration:
				T += duration
			else:
				T += timeSeries[i] - timeSeries[i - 1]
			i += 1
		T += duration
		return T


class Solution:

	def findPoisonedDuration(self, timeSeries, duration):
		res = 0
		cur = 0
		for time in timeSeries:
			res += min(duration, time + duration - cur)
			cur = time + duration
		return res