LeetCode 621. Task Scheduler 时间复杂度(O(n*m))

 时间复杂度(O(n*m))，思想：排序python class Solution: def leastInterval(self, tasks: [str], n: int) -> int: tasks_count = [0] * 26 for task in tasks: tasks_count[ord(task) - 65] +

>>阅读原文<<