leetcode::minimum_number_of_steps_to_make_two_strings_anagram_ii 命名空间参考

LeetCode 6009. 使两字符串互为字母异位词的最少步骤数 更多...

类
class	Solution

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

详细描述

LeetCode 6009. 使两字符串互为字母异位词的最少步骤数

函数说明

TEST() [1/2]

leetcode::minimum_number_of_steps_to_make_two_strings_anagram_ii::TEST	(	minimum_number_of_steps_to_make_two_strings_anagram_ii	,
		case1	)

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

                                                                            {
            ASSERT_EQ(7, Solution::minSteps("leetcode", "coats"));
        }

引用了 leetcode::minimum_number_of_steps_to_make_two_strings_anagram_ii::Solution::minSteps().

TEST() [2/2]

leetcode::minimum_number_of_steps_to_make_two_strings_anagram_ii::TEST	(	minimum_number_of_steps_to_make_two_strings_anagram_ii	,
		case2	)

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

                                                                            {
            ASSERT_EQ(0, Solution::minSteps("night", "thing"));
        }

引用了 leetcode::minimum_number_of_steps_to_make_two_strings_anagram_ii::Solution::minSteps().