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

LeetCode 5992. 基于陈述统计最多好人数 更多...

struct  msg
 
class  Solution
 

函数

 TEST (maximum_good_people_based_on_statements, case1)
 
 TEST (maximum_good_people_based_on_statements, case2)
 

详细描述

LeetCode 5992. 基于陈述统计最多好人数

函数说明

◆ TEST() [1/2]

leetcode::maximum_good_people_based_on_statements::TEST ( maximum_good_people_based_on_statements  ,
case1   
)

在文件 leetcode_test.cpp1001 行定义.

1001 {
1002 int input1[] = {2, 1, 2};
1003 int input2[] = {1, 2, 2};
1004 int input3[] = {2, 0, 2};
1005 vector<int> input[] = {vector(begin(input1), end(input1)), vector(begin(input2), end(input2)), vector(begin(input3), end(input3))};
1006 auto vec_input = vector(begin(input), end(input));
1007 ASSERT_EQ(2, Solution::maximumGood(vec_input));
1008 }

引用了 leetcode::maximum_good_people_based_on_statements::Solution::maximumGood().

◆ TEST() [2/2]

leetcode::maximum_good_people_based_on_statements::TEST ( maximum_good_people_based_on_statements  ,
case2   
)

在文件 leetcode_test.cpp1010 行定义.

1010 {
1011 int input1[] = {2, 0};
1012 int input2[] = {0, 2};
1013 vector<int> input[] = {vector(begin(input1), end(input1)), vector(begin(input2), end(input2))};
1014 auto vec_input = vector(begin(input), end(input));
1015 ASSERT_EQ(1, Solution::maximumGood(vec_input));
1016 }

引用了 leetcode::maximum_good_people_based_on_statements::Solution::maximumGood().