[Swift]LeetCode621. 任务调度器 | Task Scheduler

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

热烈欢迎，请直接点击！！！

进入博主App Store主页，下载使用各个作品！！！

注：博主将坚持每月上线一个新app！！！

Given a char array representing tasks CPU need to do. It contains capital letters A to Z where different letters represent different tasks. Tasks could be done without original order. Each task could be done in one interval. For each interval, CPU could finish one task or just be idle.

However, there is a non-negative cooling interval n that means between two same tasks, there must be at least n intervals that CPU are doing different tasks or just be idle.

You need to return the least number of intervals the CPU will take to finish all the given tasks. 

Example:

Input: tasks = ["A","A","A","B","B","B"], n = 2
Output: 8
Explanation: A -> B -> idle -> A -> B -> idle -> A -> B. 

Note:

1. The number of tasks is in the range [1, 10000].
2. The integer n is in the range [0, 100].

---

给定一个用字符数组表示的 CPU 需要执行的任务列表。其中包含使用大写的 A - Z 字母表示的26 种不同种类的任务。任务可以以任意顺序执行，并且每个任务都可以在 1 个单位时间内执行完。CPU 在任何一个单位时间内都可以执行一个任务，或者在待命状态。

然而，两个相同种类的任务之间必须有长度为 n 的冷却时间，因此至少有连续 n 个单位时间内 CPU 在执行不同的任务，或者在待命状态。

你需要计算完成所有任务所需要的最短时间。

示例 1：

输入: tasks = ["A","A","A","B","B","B"], n = 2
输出: 8
执行顺序: A -> B -> (待命) -> A -> B -> (待命) -> A -> B.

注：

1. 任务的总个数为 [1, 10000]。
2. n 的取值范围为 [0, 100]。

---

Runtime: 1100 ms

Memory Usage: 20.2 MB

class Solution {
    func leastInterval(_ tasks: [Character], _ n: Int) -> Int {
        var cnt:[Int] = [Int](repeating:0,count:26)
        for task in tasks
        {
            //A:65
            cnt[task.ascii - 65] += 1
        }
        cnt.sort()
        var i:Int = 25
        var mx:Int = cnt[25]
        var len:Int = tasks.count
        while (i >= 0 && cnt[i] == mx)
        {
            i -= 1
        }
        return max(len, (mx - 1) * (n + 1) + 25 - i)        
    }
}

//Character扩展 
extension Character  
{  
  //转ASCII整数值(定义小写为整数值)
   var ascii: Int {
       get {
           return Int(self.unicodeScalars.first!.value)
       }       
    }    
}

---

1118ms

class Solution {
    func leastInterval(_ tasks: [Character], _ n: Int) -> Int {
        guard !tasks.isEmpty else {return 0}
        var map = [Int](repeating: 0, count: 26)
        let taskStr = String(tasks)
        let offset = "A".utf8.first!
        for task in taskStr.utf8{
            let count = Int(task - offset)
            map[count] += 1
        }
        var mostFrequency = 0
        var numOfMostFrequency = 0
        for count in map {
            if count == mostFrequency {
                numOfMostFrequency += 1
            } else if count > mostFrequency {
                mostFrequency = count
                numOfMostFrequency = 1
            }
        }
        
        return max((n+1) * (mostFrequency-1) + numOfMostFrequency, tasks.count)
    }
}

---

1208ms

class Solution {
    func leastInterval(_ tasks: [Character], _ n: Int) -> Int {
        guard n > 0 else { return tasks.count }
        
        var items = Array<Int>(repeating: 0, count: 26)
        let aValue = Int(UnicodeScalar("A").value)
        tasks.forEach { (char) in
            items[Int(UnicodeScalar(String(char))!.value) - aValue] += 1
        }
        
        items.sort()
        var maxCount = items[25] - 1
        var maxIdleTimes = (items[25] - 1) * n
        
        for i in 1..<items.count {
            guard items[25 - i] > 0 else { continue }
            maxIdleTimes -= min(maxCount, items[25 - i])
        }
        
        return maxIdleTimes < 0 ? tasks.count : tasks.count + maxIdleTimes
    }
}

---

1224ms

class Solution {
    func leastInterval(_ tasks: [Character], _ n: Int) -> Int {
        var counter = [Character: Int]()
        tasks.forEach{ counter[$0, default: 0] += 1 }
        let m = counter.values.max()!
        let numMax = counter.values.filter{ $0 == m }.count
        let slots = (m - 1) * (n + 1)
        return numMax + max(slots, tasks.count - numMax)
    }
}

---

1240ms

class Solution {
    func leastInterval(_ tasks: [Character], _ n: Int) -> Int {
        var counts = [Character:Int]()
        for task in tasks {
            counts[task, default: 0] += 1   
        }
        var keys = counts.keys.sorted {
            return counts[$0]! > counts[$1]!
        }
        let maxCount = counts[keys.first!]!
        keys.removeFirst()
        var idleSlots = (maxCount - 1) * n
        for char in keys {
            idleSlots -= min(maxCount - 1, counts[char]!)
            idleSlots = max(idleSlots, 0)
        }
        return idleSlots + tasks.count
    }
}

---

1252ms

class Solution {
    func leastInterval(_ tasks: [Character], _ n: Int) -> Int {
        let totalTask = tasks.count
        guard totalTask > 0 else { return 0 }
        guard n > 0 else { return totalTask }
        var taskCount: [Character: Int] = [:]
        var biggestTaskCount = 1
        for task in tasks {
            if let count = taskCount[task] {
                taskCount[task] = count + 1
                if biggestTaskCount < count + 1 {
                    biggestTaskCount = count + 1
                }
            }else {
                taskCount[task] = 1
            }
        }
        
        if (biggestTaskCount * (n + 1)) <= tasks.count {
            return tasks.count
        }
        
        
        var total = (biggestTaskCount - 1) * (n + 1)
        
        for (_, value) in taskCount {
            if value == biggestTaskCount {
                total += 1
            }
        }
        
        return total
    }
}

---

1256ms

class Solution {
    func leastInterval(_ tasks: [Character], _ n: Int) -> Int {
        var map = [Character: Int]()
        var maxCount = 0
        for task in tasks {
            if let val = map[task] {
                map[task] = val + 1
                maxCount = max(maxCount, val + 1)
            } else {
                maxCount = max(maxCount, 1)
                map[task] = 1
            }
        }
        
        let sortedMap = map.sorted { $0.1 > $1.1 }
        maxCount -= 1
        var idlesAmount = maxCount * n
        var charCount = maxCount
        for i in 1..<sortedMap.count {
            let (key, val)  = sortedMap[i]
            idlesAmount -= min(val, maxCount)
        } 
        
        return idlesAmount > 0 ? tasks.count + idlesAmount : tasks.count        
    }
}

---

1260ms

class Solution {
    func leastInterval(_ tasks: [Character], _ n: Int) -> Int {
        var countMap: [Character: Int] = [:]
        for task in tasks {
            countMap[task] = (countMap[task] ?? 0) + 1
        }
        let maxCount: Int = countMap.values.max() ?? 0
        let fullPeriodCount = maxCount - 1
        var maxIdles = fullPeriodCount * (n + 1)
        for count in countMap.values {
            maxIdles -= min(fullPeriodCount, count)
        }
        return tasks.count + max(0, maxIdles)
    }
}

---

1264ms

class Solution {
    func isValid(_ intervals: Int, _ table: [Character: Int], _ len: Int, _ maxCount: Int, _ maxCountTies: Int) -> Bool {
        let rest = intervals%len
        var rounds = intervals/len + (rest == 0 ? 0 : 1)
        if rounds < maxCount || (rounds == maxCount && 0 < rest && rest < maxCountTies) {
            return false
        }
        
        return true
    }
    
    func binarySearch(_ low: Int, _ high: Int, _ table: [Character : Int], _ n: Int, _ maxCount: Int, _ maxCountTies: Int) -> Int {
        if low == high {
            return low
        }
        
        let mid = (low+high)/2
        if isValid(mid, table, n, maxCount, maxCountTies) == true {
            return binarySearch(low, mid, table, n, maxCount, maxCountTies)
        } else {
            return binarySearch(mid+1, high, table, n, maxCount, maxCountTies)
        }
        
    }
    
    func leastInterval(_ tasks: [Character], _ n: Int) -> Int {
        if tasks.count == 0 {
            return 0
        }
        
        if n == 0 {
            return tasks.count
        }
        
        var table: [Character: Int] = [:]
        for ch in tasks {
            table[ch] = (table[ch] ?? 0) + 1
        }
        
        var maxCount = table.values.reduce(0, {max($0, $1)})
        var maxCountTies = table.values.reduce(0, {$0 + ($1 == maxCount ? 1 : 0)})
     
        let tasksCount = tasks.count
        let low = max(tasksCount, (maxCount-1)*(n+1)+1)
        let high = tasksCount*(n+1)
        
        return binarySearch(low, high, table, n+1, maxCount, maxCountTies)        
    }
}