LeetCode 495. Teemo Attacking [tag:Array][difficulty:Medium]

题目介绍

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.

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.

解题思路

 这道题的题目看着复杂但是理解了题意就很简单了，输入为1.一个元素为 int 的数组 timeSeries 和 2. int 类型的 duration。前者代表投毒时间后者代表一个毒药持续时间。那么每次中毒时间就是duration或者是这一此到下一次投毒时间差（如果小于duration的话），代码如下

class Solution(object):
    def findPoisonedDuration(self, timeSeries, duration):
        """
        :type timeSeries: List[int]
        :type duration: int
        :rtype: int
        """
        result = 0
        for i in range(len(timeSeries)-1):  # top N-1 attacking
            result += duration if timeSeries[i+1] - timeSeries[i] >= duration else timeSeries[i+1] - timeSeries[i]
         
        result += duration #for the last one
        return result

后来发现 

result += duration if timeSeries[i+1] - timeSeries[i] >= duration else timeSeries[i+1] - timeSeries[i]

可以替换为

result += min(duration,timeSeries[i+1] - timeSeries[i])

更加简洁

另外运行测试时在输入timeSeries为 [] 空List时报错，所以应当加入一个判断为空的条件：完整代码如下：

class Solution(object):
    def findPoisonedDuration(self, timeSeries, duration):
        """
        :type timeSeries: List[int]
        :type duration: int
        :rtype: int
        """
        if len(timeSeries)==0 : return 0 
        result = 0
        for i in range(len(timeSeries)-1):  # top N-1 attacking
            result += duration if timeSeries[i+1] - timeSeries[i] >= duration else timeSeries[i+1] - timeSeries[i]
            #or
            #result += min(duration,timeSeries[i+1] - timeSeries[i])
        result += duration #for the last one
        return result