leetcode::find_all_k_distant_indices_in_an_array 命名空间参考

LeetCode 6031. 找出数组中的所有 K 近邻下标 更多...

类
class	Solution

函数
	TEST (find_all_k_distant_indices_in_an_array, case1)
	TEST (find_all_k_distant_indices_in_an_array, case2)

详细描述

LeetCode 6031. 找出数组中的所有 K 近邻下标

函数说明

TEST() [1/2]

leetcode::find_all_k_distant_indices_in_an_array::TEST	(	find_all_k_distant_indices_in_an_array	,
		case1
	)

在文件 leetcode_test.cpp 第 2178 行定义.

                                                            {
            vector nums         = {3, 4, 9, 1, 3, 9, 5};
            const vector output = {1, 2, 3, 4, 5, 6};
            ASSERT_EQ(output, Solution::findKDistantIndices(nums, 9, 1));
        }

引用了 leetcode::find_all_k_distant_indices_in_an_array::Solution::findKDistantIndices().

TEST() [2/2]

leetcode::find_all_k_distant_indices_in_an_array::TEST	(	find_all_k_distant_indices_in_an_array	,
		case2
	)

在文件 leetcode_test.cpp 第 2184 行定义.

                                                            {
            vector nums         = {2, 2, 2, 2, 2};
            const vector output = {0, 1, 2, 3, 4};
            ASSERT_EQ(output, Solution::findKDistantIndices(nums, 2, 2));
        }

引用了 leetcode::find_all_k_distant_indices_in_an_array::Solution::findKDistantIndices().