leetcode::maximize_number_of_subsequences_in_a_string 命名空间参考

LeetCode 6021. Maximize Number of Subsequences in a String 更多...

类
class	Solution

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

详细描述

LeetCode 6021. Maximize Number of Subsequences in a String

函数说明

TEST() [1/2]

leetcode::maximize_number_of_subsequences_in_a_string::TEST	(	maximize_number_of_subsequences_in_a_string	,
		case1
	)

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

                                                                 {
            ASSERT_EQ(4, Solution::maximumSubsequenceCount("abdcdbc", "ac"));
        }

引用了 leetcode::maximize_number_of_subsequences_in_a_string::Solution::maximumSubsequenceCount().

TEST() [2/2]

leetcode::maximize_number_of_subsequences_in_a_string::TEST	(	maximize_number_of_subsequences_in_a_string	,
		case2
	)

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

                                                                 {
            ASSERT_EQ(6, Solution::maximumSubsequenceCount("aabb", "ab"));
        }

引用了 leetcode::maximize_number_of_subsequences_in_a_string::Solution::maximumSubsequenceCount().