Package g1601_1700.s1606_find_servers_that_handled_most_number_of_requests

Class Solution

java.lang.Object

g1601_1700.s1606_find_servers_that_handled_most_number_of_requests.Solution

public class Solution
extends Object

1606 - Find Servers That Handled Most Number of Requests.<p>Hard</p> <p>You have <code>k</code> servers numbered from <code>0</code> to <code>k-1</code> that are being used to handle multiple requests simultaneously. Each server has infinite computational capacity but <strong>cannot handle more than one request at a time</strong>. The requests are assigned to servers according to a specific algorithm:</p> <ul> <li>The <code>i^th</code> (0-indexed) request arrives.</li> <li>If all servers are busy, the request is dropped (not handled at all).</li> <li>If the <code>(i % k)^th</code> server is available, assign the request to that server.</li> <li>Otherwise, assign the request to the next available server (wrapping around the list of servers and starting from 0 if necessary). For example, if the <code>i^th</code> server is busy, try to assign the request to the <code>(i+1)^th</code> server, then the <code>(i+2)^th</code> server, and so on.</li> </ul> <p>You are given a <strong>strictly increasing</strong> array <code>arrival</code> of positive integers, where <code>arrival[i]</code> represents the arrival time of the <code>i^th</code> request, and another array <code>load</code>, where <code>load[i]</code> represents the load of the <code>i^th</code> request (the time it takes to complete). Your goal is to find the <strong>busiest server(s)</strong>. A server is considered <strong>busiest</strong> if it handled the most number of requests successfully among all the servers.</p> <p>Return <em>a list containing the IDs (0-indexed) of the <strong>busiest server(s)</strong></em>. You may return the IDs in any order.</p> <p><strong>Example 1:</strong></p> <p><img src="https://assets.leetcode.com/uploads/2020/09/08/load-1.png" alt="" /></p> <p><strong>Input:</strong> k = 3, arrival = [1,2,3,4,5], load = [5,2,3,3,3]</p> <p><strong>Output:</strong> [1]</p> <p><strong>Explanation:</strong></p> <p>All of the servers start out available.</p> <p>The first 3 requests are handled by the first 3 servers in order.</p> <p>Request 3 comes in. Server 0 is busy, so it&rsquo;s assigned to the next available server, which is 1.</p> <p>Request 4 comes in. It cannot be handled since all servers are busy, so it is dropped.</p> <p>Servers 0 and 2 handled one request each, while server 1 handled two requests. Hence server 1 is the busiest server.</p> <p><strong>Example 2:</strong></p> <p><strong>Input:</strong> k = 3, arrival = [1,2,3,4], load = [1,2,1,2]</p> <p><strong>Output:</strong> [0]</p> <p><strong>Explanation:</strong></p> <p>The first 3 requests are handled by first 3 servers.</p> <p>Request 3 comes in. It is handled by server 0 since the server is available.</p> <p>Server 0 handled two requests, while servers 1 and 2 handled one request each. Hence server 0 is the busiest server.</p> <p><strong>Example 3:</strong></p> <p><strong>Input:</strong> k = 3, arrival = [1,2,3], load = [10,12,11]</p> <p><strong>Output:</strong> [0,1,2]</p> <p><strong>Explanation:</strong> Each server handles a single request, so they are all considered the busiest.</p> <p><strong>Constraints:</strong></p> <ul> <li><code>1 <= k <= 10⁵</code></li> <li><code>1 <= arrival.length, load.length <= 10⁵</code></li> <li><code>arrival.length == load.length</code></li> <li><code>1 <= arrival[i], load[i] <= 10⁹</code></li> <li><code>arrival</code> is <strong>strictly increasing</strong>.</li> </ul>

Constructor Summary

Constructors

Constructor	Description
Solution()

Method Summary

Modifier and Type	Method	Description
List<Integer>	busiestServers(int k, int[] arrival, int[] load)

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Details

Solution

public Solution()

Method Details

busiestServers

public List<Integer> busiestServers(int k,
 int[] arrival,
 int[] load)