?[4]621. Task Scheduler(Java)
来源:互联网 发布:dvp_60es编程 编辑:程序博客网 时间:2024/06/06 01:45
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 1:
Input: tasks = ['A','A','A','B','B','B'], n = 2Output: 8Explanation: A -> B -> idle -> A -> B -> idle -> A -> B.
Note:
The number of tasks is in the range [1, 10000].The integer n is in the range [0, 100].
代码1:
class Solution { public int leastInterval(char[] tasks, int n) { int[] alpNum = new int[26]; for (int i = 0; i < tasks.length; i ++) { alpNum[tasks[i] - 'A'] ++; } Arrays.sort(alpNum); int i, maxNum = 0; for (i = 24; alpNum[i] == alpNum[25]; i --) { maxNum ++; } return Math.max((alpNum[25] - 1) * n + alpNum[25] + maxNum, tasks.length); }}
代码2:用优先队列实现(未懂???)
public int leastInterval(char[] tasks, int n) { Map<Character, Integer> map = new HashMap<>(); for (int i = 0; i < tasks.length; i++) { map.put(tasks[i], map.getOrDefault(tasks[i], 0) + 1); // map key is TaskName, and value is number of times to be executed. } PriorityQueue<Map.Entry<Character, Integer>> q = new PriorityQueue<>( //frequency sort (a,b) -> a.getValue() != b.getValue() ? b.getValue() - a.getValue() : a.getKey() - b.getKey()); q.addAll(map.entrySet()); int count = 0; while (!q.isEmpty()) { int k = n + 1; List<Map.Entry> tempList = new ArrayList<>(); while (k > 0 && !q.isEmpty()) { Map.Entry<Character, Integer> top = q.poll(); // most frequency task top.setValue(top.getValue() - 1); // decrease frequency, meaning it got executed tempList.add(top); // collect task to add back to queue k--; count++; //successfully executed task } for (Map.Entry<Character, Integer> e : tempList) { if (e.getValue() > 0) q.add(e); // add valid tasks } if (q.isEmpty()) break; count = count + k; // if k > 0, then it means we need to be idle } return count;}
阅读全文
0 0
- ?[4]621. Task Scheduler(Java)
- Windows Scheduler + Java Task
- LeetCode 621. Task Scheduler
- 【LeetCode】621. Task Scheduler
- 621. Task Scheduler
- [LeetCode] 621. Task Scheduler
- Leetcode 621. Task Scheduler
- [leetcode]621. Task Scheduler
- leetcode 621. Task Scheduler
- Leetcode:621. Task Scheduler
- 621. Task Scheduler
- [LeetCode]621. Task Scheduler
- 621. Task Scheduler
- 621. Task Scheduler
- 621. Task Scheduler
- leetcode 621. Task Scheduler
- Leetcode 621. Task Scheduler
- leetcode 621. Task Scheduler
- Hibernate之关联映射(上)
- HDU 1905Pseudoprime numbers(快速幂)
- 2017开学训练第二周周中总结
- Apache-ab安装使用
- Windows程序设计-GDI图形
- ?[4]621. Task Scheduler(Java)
- 关于文件系统的一些理解
- 林青的学业博客
- 纯JS实现图片验证码功能并兼容IE6-8(推荐)
- FtpClient文件的下载
- 二分搜索树
- LeetCode 6 :Zigzag Conversion
- Codeforces Round #433
- HDU 2157How many ways??(矩阵快速幂)