-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathWordBreak2.cpp
74 lines (63 loc) · 1.75 KB
/
WordBreak2.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
// { Driver Code Starts
// Initial Template for C++
#include <bits/stdc++.h>
using namespace std;
// } Driver Code Ends
// User function Template for C++
class Solution {
public:
void wordBreakUtil(unordered_set<string> &us, string s, int ind, int n, vector<string> &ans, string &res) {
if (ind >= s.size()) {
// cout << s << endl;
if (us.find(s) != us.end()) {
ans.push_back(res + s);
}
return;
}
string sub = s.substr(0, ind);
// cout << sub << endl << s << endl << endl;
if (us.find(sub) != us.end()) {
res += sub;
res += " ";
wordBreakUtil(us, s.substr(ind), 0, n, ans, res);
res.pop_back();
for (auto ele : sub) res.pop_back();
}
wordBreakUtil(us, s, ind + 1, n, ans, res);
}
vector<string> wordBreak(int n, vector<string>& dict, string s)
{
unordered_set<string> us(dict.begin(), dict.end());
vector<string> ans;
string res;
wordBreakUtil(us, s, 0, s.length(), ans, res);
return ans;
}
};
// { Driver Code Starts.
int main() {
int t;
cin >> t;
while (t--) {
int n;
vector<string> dict;
string s;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> s;
dict.push_back(s);
}
cin >> s;
Solution ob;
vector<string> ans = ob.wordBreak(n, dict, s);
if (ans.size() == 0)
cout << "Empty\n";
else {
sort(ans.begin(), ans.end());
for (int i = 0; i < ans.size(); i++)
cout << "(" << ans[i] << ")";
cout << endl;
}
}
return 0;
} // } Driver Code Ends