leetcode::concatenated_words 命名空间参考

类
class	Solution
class	TrieNode

函数
	TEST (concatenated_words, case1)
	TEST (concatenated_words, case2)
	TEST (concatenated_words, case4)

函数说明

TEST() [1/3]

leetcode::concatenated_words::TEST	(	concatenated_words	,
		case1	)

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

                                        {
            basic_string<char> input[] = {
                    "cat", "cats", "catsdogcats", "dog", "dogcatsdog", "hippopotamuses", "rat",
                    "ratcatdogcat"};
            auto vec           = vector(begin(input), end(input));
            const auto ans     = Solution::findAllConcatenatedWordsInADict(vec);
            string outputstr[] = {"catsdogcats", "dogcatsdog", "ratcatdogcat"};
            const auto output  = vector(begin(outputstr), end(outputstr));
            for(const string &str: ans) {
                ASSERT_TRUE(find(output.cbegin(), output.cend(), str) != output.cend());
            }
            for(const string &str: output) {
                ASSERT_TRUE(find(ans.cbegin(), ans.cend(), str) != ans.cend());
            }
            ASSERT_EQ(ans.size(), output.size());
        }

引用了 leetcode::concatenated_words::Solution::findAllConcatenatedWordsInADict().

TEST() [2/3]

leetcode::concatenated_words::TEST	(	concatenated_words	,
		case2	)

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

                                        {
            basic_string<char> input[] = {"cat", "dog", "catdog"};
            auto vec                   = vector(begin(input), end(input));
            const auto ans             = Solution::findAllConcatenatedWordsInADict(vec);
            string outputstr[]         = {"catdog"};
            const auto output          = vector(begin(outputstr), end(outputstr));
            for(const string &str: ans) {
                ASSERT_TRUE(find(output.cbegin(), output.cend(), str) != output.cend());
            }
            for(const string &str: output) {
                ASSERT_TRUE(find(ans.cbegin(), ans.cend(), str) != ans.cend());
            }
            ASSERT_EQ(ans.size(), output.size());
        }

引用了 leetcode::concatenated_words::Solution::findAllConcatenatedWordsInADict().

TEST() [3/3]

leetcode::concatenated_words::TEST	(	concatenated_words	,
		case4	)

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

                                        {
            basic_string<char> input[] = {"nuqhmfj", "mf", "jf", "n", "u", "q", "h"};
            auto vec                   = vector(begin(input), end(input));
            const auto ans             = Solution::findAllConcatenatedWordsInADict(vec);
            const auto output          = vector<string>();
            for(const string &str: ans) {
                ASSERT_TRUE(find(output.cbegin(), output.cend(), str) != output.cend());
            }
            for(const string &str: output) {
                ASSERT_TRUE(find(ans.cbegin(), ans.cend(), str) != ans.cend());
            }
            ASSERT_EQ(ans.size(), output.size());
        }

引用了 leetcode::concatenated_words::Solution::findAllConcatenatedWordsInADict().