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

★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★
➤微信公众号：山青咏芝（shanqingyongzhi）
➤博客园地址：山青咏芝（https://www.cnblogs.com/strengthen/）
➤GitHub地址：https://github.com/strengthen/LeetCode
➤原文地址：https://www.cnblogs.com/strengthen/p/10370594.html 
➤如果链接不是山青咏芝的博客园地址，则可能是爬取作者的文章。
➤原文已修改更新！强烈建议点击原文地址阅读！支持作者！支持原创！
★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★

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.

---

在《英雄联盟》的世界中，有一个叫 “提莫” 的英雄，他的攻击可以让敌方英雄艾希（编者注：寒冰射手）进入中毒状态。现在，给出提莫对艾希的攻击时间序列和提莫攻击的中毒持续时间，你需要输出艾希的中毒状态总时长。

你可以认为提莫在给定的时间点进行攻击，并立即使艾希处于中毒状态。

示例1:

输入: [1,4], 2
输出: 4
原因: 在第 1 秒开始时，提莫开始对艾希进行攻击并使其立即中毒。中毒状态会维持 2 秒钟，直到第 2 秒钟结束。
在第 4 秒开始时，提莫再次攻击艾希，使得艾希获得另外 2 秒的中毒时间。
所以最终输出 4 秒。

示例2:

输入: [1,2], 2
输出: 3
原因: 在第 1 秒开始时，提莫开始对艾希进行攻击并使其立即中毒。中毒状态会维持 2 秒钟，直到第 2 秒钟结束。
但是在第 2 秒开始时，提莫再次攻击了已经处于中毒状态的艾希。
由于中毒状态不可叠加，提莫在第 2 秒开始时的这次攻击会在第 3 秒钟结束。
所以最终输出 3。

注意：

1. 你可以假定时间序列数组的总长度不超过 10000。
2. 你可以假定提莫攻击时间序列中的数字和提莫攻击的中毒持续时间都是非负整数，并且不超过 10,000,000。

---

64ms

class Solution {
    func findPoisonedDuration(_ timeSeries: [Int], _ duration: Int) -> Int {
        let count = timeSeries.count
        guard count > 0 else {
            return 0
        }
        
        var left = timeSeries[0]
        var right = timeSeries[0]
        var total = 0
        
        for index in 1..<count {
            if right + duration < timeSeries[index] {
                total += right - left + duration
                left = timeSeries[index]
            }
            right = timeSeries[index]
        }
        total += right - left + duration
    
        return total
    }
}

---

388ms

class Solution {
    func findPoisonedDuration(_ timeSeries: [Int], _ duration: Int) -> Int {
        guard timeSeries.count > 0 else { return 0 }
        var totalDuration = duration
        for index in 1..<timeSeries.count {
            var lastMax = timeSeries[index - 1] + duration - 1
            if lastMax < timeSeries[index] {
                totalDuration += duration
            } else {
                let currMax = timeSeries[index] + duration - 1
                totalDuration += (currMax - lastMax)
            }
        }
        return totalDuration
    }
}

---

392ms

class Solution {
    func findPoisonedDuration(_ timeSeries: [Int], _ duration: Int) -> Int {
        if timeSeries.isEmpty {return 0}
        var res:Int = 0
        var n:Int = timeSeries.count
        for i in 1..<n
        {
            var diff:Int = timeSeries[i] - timeSeries[i - 1]
            res += (diff < duration) ? diff : duration
        }
        return res + duration
    }
}

---

392ms

class Solution {
    func findPoisonedDuration(_ timeSeries: [Int], _ duration: Int) -> Int {
        if timeSeries.isEmpty {return 0}
        var res:Int = 0
        var n:Int = timeSeries.count
        for i in 1..<n
        {
            var diff:Int = timeSeries[i] - timeSeries[i - 1]
            res += (diff < duration) ? diff : duration
        }
        return res + duration
    }
}

---

396ms

class Solution {
func findPoisonedDuration(_ timeSeries: [Int], _ duration: Int) -> Int {
    if timeSeries.count == 0 {
        return 0
    }
    if timeSeries.count == 1 {
        return duration
    }
    
    var result = 0
    
    for i in 0..<timeSeries.count-1 {
        if timeSeries[i] + duration <= timeSeries[i + 1] {
            result += duration
        }
        else {
            result += (timeSeries[i + 1] - timeSeries[i])
        }
    }
    
    result += duration
    
    return result
  }
}

---

440ms

class Solution {
    func findPoisonedDuration(_ timeSeries: [Int], _ duration: Int) -> Int {
        var res = 0, start = -1, end = -1
        for t in timeSeries.sorted() {
            if t > end {
                res += end - start
                start = t
            }
            end = t + duration
        }
        return res + end - start
    }
}