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

LeetCode 6024. 数组中紧跟 key 之后出现最频繁的数字 更多...

class  Solution
 

函数

 TEST (most_frequent_number_following_key_in_an_array, case1)
 
 TEST (most_frequent_number_following_key_in_an_array, case2)
 

详细描述

LeetCode 6024. 数组中紧跟 key 之后出现最频繁的数字

函数说明

◆ TEST() [1/2]

leetcode::most_frequent_number_following_key_in_an_array::TEST ( most_frequent_number_following_key_in_an_array  ,
case1   
)

在文件 leetcode_test.cpp1974 行定义.

1974 {
1975 vector input = {1, 100, 200, 1, 100};
1976 ASSERT_EQ(100, Solution::mostFrequent(input, 1));
1977 }

引用了 leetcode::most_frequent_number_following_key_in_an_array::Solution::mostFrequent().

◆ TEST() [2/2]

leetcode::most_frequent_number_following_key_in_an_array::TEST ( most_frequent_number_following_key_in_an_array  ,
case2   
)

在文件 leetcode_test.cpp1979 行定义.

1979 {
1980 vector input = {2, 2, 2, 2, 3};
1981 ASSERT_EQ(2, Solution::mostFrequent(input, 2));
1982 }

引用了 leetcode::most_frequent_number_following_key_in_an_array::Solution::mostFrequent().