leetcode::minimum_number_of_k_consecutive_bit_flips 命名空间参考

1. K 连续位的最小翻转次数

更多...

类
class	Solution

函数
	TEST (minimum_number_of_k_consecutive_bit_flips, case1)
	TEST (minimum_number_of_k_consecutive_bit_flips, case2)
	TEST (minimum_number_of_k_consecutive_bit_flips, case3)

详细描述

1. K 连续位的最小翻转次数

函数说明

TEST() [1/3]

leetcode::minimum_number_of_k_consecutive_bit_flips::TEST	(	minimum_number_of_k_consecutive_bit_flips	,
		case1
	)

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

                                                               {
            vector nums = {0, 1, 0};
            ASSERT_EQ(2, Solution::minKBitFlips(nums, 1));
        }

引用了 leetcode::minimum_number_of_k_consecutive_bit_flips::Solution::minKBitFlips().

TEST() [2/3]

leetcode::minimum_number_of_k_consecutive_bit_flips::TEST	(	minimum_number_of_k_consecutive_bit_flips	,
		case2
	)

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

                                                               {
            vector nums = {1, 1, 0};
            ASSERT_EQ(-1, Solution::minKBitFlips(nums, 2));
        }

引用了 leetcode::minimum_number_of_k_consecutive_bit_flips::Solution::minKBitFlips().

TEST() [3/3]

leetcode::minimum_number_of_k_consecutive_bit_flips::TEST	(	minimum_number_of_k_consecutive_bit_flips	,
		case3
	)

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

                                                               {
            vector nums = {0, 0, 0, 1, 0, 1, 1, 0};
            ASSERT_EQ(3, Solution::minKBitFlips(nums, 3));
        }

引用了 leetcode::minimum_number_of_k_consecutive_bit_flips::Solution::minKBitFlips().