problemscpp
A collection of my answers to algorithm problems in c++.
| 函数
leetcode::find_servers_that_handled_most_number_of_requests 命名空间参考

  1. Find Servers That Handled Most Number of Requests
更多...

struct  event
 
class  Solution
 

函数

 TEST (find_servers_that_handled_most_number_of_requests, case1)
 
 TEST (find_servers_that_handled_most_number_of_requests, case2)
 
 TEST (find_servers_that_handled_most_number_of_requests, case3)
 
 TEST (find_servers_that_handled_most_number_of_requests, case4)
 

详细描述

  1. Find Servers That Handled Most Number of Requests

函数说明

◆ TEST() [1/4]

leetcode::find_servers_that_handled_most_number_of_requests::TEST ( find_servers_that_handled_most_number_of_requests  ,
case1   
)

在文件 leetcode_test.cpp2555 行定义.

2555 {
2556 vector arrival = {1, 2, 3, 4, 5};
2557 vector load = {5, 2, 3, 3, 3};
2558 const vector output = {1};
2559 ASSERT_EQ(output, Solution::busiestServers(3, arrival, load));
2560 }

引用了 leetcode::find_servers_that_handled_most_number_of_requests::Solution::busiestServers().

◆ TEST() [2/4]

leetcode::find_servers_that_handled_most_number_of_requests::TEST ( find_servers_that_handled_most_number_of_requests  ,
case2   
)

在文件 leetcode_test.cpp2562 行定义.

2562 {
2563 vector arrival = {1, 2, 3, 4};
2564 vector load = {1, 2, 1, 2};
2565 const vector output = {0};
2566 ASSERT_EQ(output, Solution::busiestServers(3, arrival, load));
2567 }

引用了 leetcode::find_servers_that_handled_most_number_of_requests::Solution::busiestServers().

◆ TEST() [3/4]

leetcode::find_servers_that_handled_most_number_of_requests::TEST ( find_servers_that_handled_most_number_of_requests  ,
case3   
)

在文件 leetcode_test.cpp2569 行定义.

2569 {
2570 vector arrival = {1, 2, 3};
2571 vector load = {10, 12, 11};
2572 const vector output = {0, 1, 2};
2573 ASSERT_EQ(output, Solution::busiestServers(3, arrival, load));
2574 }

引用了 leetcode::find_servers_that_handled_most_number_of_requests::Solution::busiestServers().

◆ TEST() [4/4]

leetcode::find_servers_that_handled_most_number_of_requests::TEST ( find_servers_that_handled_most_number_of_requests  ,
case4   
)

在文件 leetcode_test.cpp2576 行定义.

2576 {
2577 vector arrival = {1, 2, 3};
2578 vector load = {1000000000, 1, 1000000000};
2579 const vector output = {1};
2580 ASSERT_EQ(output, Solution::busiestServers(2, arrival, load));
2581 }

引用了 leetcode::find_servers_that_handled_most_number_of_requests::Solution::busiestServers().