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.cpp 第 2555 行定义.

                                                                       {
            vector arrival      = {1, 2, 3, 4, 5};
            vector load         = {5, 2, 3, 3, 3};
            const vector output = {1};
            ASSERT_EQ(output, Solution::busiestServers(3, arrival, load));
        }

引用了 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.cpp 第 2562 行定义.

                                                                       {
            vector arrival      = {1, 2, 3, 4};
            vector load         = {1, 2, 1, 2};
            const vector output = {0};
            ASSERT_EQ(output, Solution::busiestServers(3, arrival, load));
        }

引用了 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.cpp 第 2569 行定义.

                                                                       {
            vector arrival      = {1, 2, 3};
            vector load         = {10, 12, 11};
            const vector output = {0, 1, 2};
            ASSERT_EQ(output, Solution::busiestServers(3, arrival, load));
        }

引用了 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.cpp 第 2576 行定义.

                                                                       {
            vector arrival      = {1, 2, 3};
            vector load         = {1000000000, 1, 1000000000};
            const vector output = {1};
            ASSERT_EQ(output, Solution::busiestServers(2, arrival, load));
        }

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