74 basic_string<char> input[] = {
75 "cat",
"cats",
"catsdogcats",
"dog",
"dogcatsdog",
"hippopotamuses",
"rat",
77 auto vec = vector(begin(input), end(input));
78 const auto ans = Solution::findAllConcatenatedWordsInADict(
vec);
79 string outputstr[] = {
"catsdogcats",
"dogcatsdog",
"ratcatdogcat"};
80 const auto output = vector(begin(outputstr), end(outputstr));
81 for(
const string &str: ans) {
82 ASSERT_TRUE(
find(output.cbegin(), output.cend(), str) != output.cend());
84 for(
const string &str: output) {
85 ASSERT_TRUE(
find(ans.cbegin(), ans.cend(), str) != ans.cend());
87 ASSERT_EQ(ans.size(), output.size());
bool find(vector< unordered_set< int > > &g, int x, vector< bool > &st, vector< int > &match)