#include <leetcode.h>
|
static vector< int > | busiestServers (int k, vector< int > &arrival, vector< int > &load) |
|
◆ busiestServers()
vector< int > leetcode::find_servers_that_handled_most_number_of_requests::Solution::busiestServers |
( |
int |
k, |
|
|
vector< int > & |
arrival, |
|
|
vector< int > & |
load |
|
) |
| |
|
static |
在文件 leetcode.cpp 第 5262 行定义.
5266 for(
int i = 0; i < k; i++) {
5267 available.insert(i);
5269 priority_queue<event> events;
5270 for(
int i = 0; i < arrival.size(); i++) {
5271 event e = {arrival[i],
true, i};
5274 while(!events.empty()) {
5275 event e = events.top();
5278 if(!available.empty()) {
5279 auto it = available.lower_bound(e.index % k);
5280 if(it == available.end()) {
5281 it = available.begin();
5283 event next = {e.time + load[e.index],
false, e.index, *it};
5285 available.erase(it);
5289 available.insert(e.server_index);
5290 count[e.server_index]++;
5293 const int maximum = *max_element(count.begin(), count.end());
5294 for(
int i = 0; i < k; i++) {
5295 if(count[i] == maximum) {
被这些函数引用 leetcode::find_servers_that_handled_most_number_of_requests::TEST().
该类的文档由以下文件生成: