From d9127ec4834594a91aa649cbd844b6f05afd5d44 Mon Sep 17 00:00:00 2001 From: Leah Jia <99011487+leahjia@users.noreply.github.com> Date: Sat, 20 May 2023 20:26:28 -0700 Subject: [PATCH] Create 1882-process-tasks-using-servers.java --- java/1882-process-tasks-using-servers.java | 36 ++++++++++++++++++++++ 1 file changed, 36 insertions(+) create mode 100644 java/1882-process-tasks-using-servers.java diff --git a/java/1882-process-tasks-using-servers.java b/java/1882-process-tasks-using-servers.java new file mode 100644 index 000000000..ddf4181a4 --- /dev/null +++ b/java/1882-process-tasks-using-servers.java @@ -0,0 +1,36 @@ +class Solution { + public int[] assignTasks(int[] servers, int[] tasks) { + int[] res = new int[tasks.length]; + + // [weight, index] + Queue available = new PriorityQueue<>((a, b) -> a[0] == b[0] ? a[1] - b[1] : a[0] - b[0]); + for (int i = 0; i < servers.length; i++) + available.add(new int[] { servers[i], i }); + + int time = 0; + int nextTask = 0; + // [weight, index, done time] + Queue unavail = new PriorityQueue<>((a, b) -> a[2] - b[2]); + while (nextTask < tasks.length) { + // release available servers + while (!unavail.isEmpty() && unavail.peek()[2] <= time) { + int[] curr = unavail.poll(); + available.add(new int[] { curr[0], curr[1] }); + } + + // assign task(s) + while (!available.isEmpty() && nextTask < time && nextTask != tasks.length) { + int[] curr = available.poll(); + unavail.add(new int[] { curr[0], curr[1], time + tasks[nextTask] }); + res[nextTask++] = curr[1]; + } + + // advance time + if (available.isEmpty()) + time = unavail.peek()[2]; + else + time++; + } + return res; + } +} \ No newline at end of file pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy