aboutsummaryrefslogtreecommitdiff
path: root/other/task_scheduler.cpp
diff options
context:
space:
mode:
authorJack Sangdahl <[email protected]>2025-03-10 00:36:13 -0600
committerJack Sangdahl <[email protected]>2025-03-10 00:36:13 -0600
commit7c60dee83b436e8e8a667bf9f191beced8de4fc3 (patch)
treeeb7a24ee2067f92245c57bb118e85a1baf15df50 /other/task_scheduler.cpp
parent5d7cdc215e4ba1ec4cbb24c084cccb5e5e641468 (diff)
downloadleetcode-7c60dee83b436e8e8a667bf9f191beced8de4fc3.tar.gz
leetcode-7c60dee83b436e8e8a667bf9f191beced8de4fc3.zip
chore: move cpp and rust code to directory
Diffstat (limited to 'other/task_scheduler.cpp')
-rw-r--r--other/task_scheduler.cpp36
1 files changed, 36 insertions, 0 deletions
diff --git a/other/task_scheduler.cpp b/other/task_scheduler.cpp
new file mode 100644
index 0000000..553dd5d
--- /dev/null
+++ b/other/task_scheduler.cpp
@@ -0,0 +1,36 @@
+// 2365. Task Scheduler II
+#include "leetcode.h"
+
+/*
+ * given a 0-indexed array of positive integers 'tasks', representing tasks that
+ * need to be completed in order, where 'tasks[i]' represents the type of the
+ * i'th task. you are also given a positve integer 'space' which represents the
+ * minimum number of days that must pass after the completion of a task before
+ * another task of the same type can be performed. each day until all tasks have
+ * been completed, you must either
+ * - complete the next task from 'tasks' or
+ * - take a break
+ * return the minimum number of days needed to complete all tasks.
+ */
+
+class Solution {
+public:
+ long long taskSchedulerII(vector<int> &tasks, int space) {
+ unordered_map<int, long long> last;
+ long long ans = 0;
+ for (int t : tasks) {
+ if (last.count(t))
+ last[t] = ans = max(ans, last[t] + space) + 1;
+ else
+ last[t] = ++ans;
+ }
+ return ans;
+ }
+};
+
+int main() {
+ Solution obj;
+ vector<int> t1 = {1, 2, 1, 2, 3, 1}, t2 = {5, 8, 8, 5};
+ printf("%lld\n", obj.taskSchedulerII(t1, 3)); // expect: 9
+ printf("%lld\n", obj.taskSchedulerII(t2, 2)); // expect: 6
+}