problemscpp
A collection of my answers to algorithm problems in c++.
| 函数
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.cpp73 行定义.

73 {
74 basic_string<char> input[] = {
75 "cat", "cats", "catsdogcats", "dog", "dogcatsdog", "hippopotamuses", "rat",
76 "ratcatdogcat"};
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());
83 }
84 for(const string &str: output) {
85 ASSERT_TRUE(find(ans.cbegin(), ans.cend(), str) != ans.cend());
86 }
87 ASSERT_EQ(ans.size(), output.size());
88 }
bool find(vector< unordered_set< int > > &g, int x, vector< bool > &st, vector< int > &match)
Definition: acwing.cpp:7522
int vec[100010]
Definition: pat.cpp:5095

引用了 acwing::acwing861::find(), leetcode::concatenated_words::Solution::findAllConcatenatedWordsInADict() , 以及 pat::a::a7_2::vec.

◆ TEST() [2/3]

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

在文件 leetcode_test.cpp90 行定义.

90 {
91 basic_string<char> input[] = {"cat", "dog", "catdog"};
92 auto vec = vector(begin(input), end(input));
93 const auto ans = Solution::findAllConcatenatedWordsInADict(vec);
94 string outputstr[] = {"catdog"};
95 const auto output = vector(begin(outputstr), end(outputstr));
96 for(const string &str: ans) {
97 ASSERT_TRUE(find(output.cbegin(), output.cend(), str) != output.cend());
98 }
99 for(const string &str: output) {
100 ASSERT_TRUE(find(ans.cbegin(), ans.cend(), str) != ans.cend());
101 }
102 ASSERT_EQ(ans.size(), output.size());
103 }

引用了 acwing::acwing861::find(), leetcode::concatenated_words::Solution::findAllConcatenatedWordsInADict() , 以及 pat::a::a7_2::vec.

◆ TEST() [3/3]

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

在文件 leetcode_test.cpp105 行定义.

105 {
106 basic_string<char> input[] = {"nuqhmfj", "mf", "jf", "n", "u", "q", "h"};
107 auto vec = vector(begin(input), end(input));
108 const auto ans = Solution::findAllConcatenatedWordsInADict(vec);
109 const auto output = vector<string>();
110 for(const string &str: ans) {
111 ASSERT_TRUE(find(output.cbegin(), output.cend(), str) != output.cend());
112 }
113 for(const string &str: output) {
114 ASSERT_TRUE(find(ans.cbegin(), ans.cend(), str) != ans.cend());
115 }
116 ASSERT_EQ(ans.size(), output.size());
117 }

引用了 acwing::acwing861::find(), leetcode::concatenated_words::Solution::findAllConcatenatedWordsInADict() , 以及 pat::a::a7_2::vec.