题目:
Given a string s and a dictionary of words dict, add spaces in s to construct a sentence where each word is a valid dictionary word.
Return all such possible sentences.
给一个字符串s和一个字典,在s中增加空格,构造一个句子,句子中的每个单词必须都是字典中的单词。
For example, given
s = "catsanddog"
,
dict = ["cat", "cats", "and", "sand", "dog"]
.
A solution is ["cats and dog", "cat sand dog"]
.
思路:
先参考Word Break (断词): http://blog.csdn.net/u012243115/article/details/42609679 。先用DP构造一个图,然后对图使用DFS构造出所有可能。
代码:
class Solution {
public:
vector<string> wordBreak(string s, unordered_set<string> &dict)
{
vector<string> result;
vector<string> path;
vector<bool> f(s.size()+1,false);
// prev[i][j] 为 true,表示 s[j, i-1] 是一个合法单词,可以从 j 处切开,第一行没有用
vector<vector<bool> > prev(s.size() + 1 , vector<bool>(s.size()));
f[0] = true;
for(int i = 1 ; i <= s.size() ; i++)
{
for(int j = 0 ; j < i ; j++)
{
if(f[j] && (dict.find(s.substr(j,i-j)) != dict.end()))
{
f[i] = true;
prev[i][j] = true;//表示s[j,i-1]是一个合法单词
}
}
}
DFS(s,prev,s.size(),path,result);
return result;
}
void DFS(string &s , vector<vector<bool> > &prev , int cur , vector<string> &path , vector<string> &result)
{
if(cur == 0)
{
string tmp;
for(auto iter = path.rbegin() ; iter != path.rend() ; iter++)
{
tmp += *iter + " ";
}
tmp.erase(tmp.end()-1);
result.push_back(tmp);
}
for(int i = 0 ; i < s.size() ; i++)
{
if(prev[cur][i])
{
path.push_back(s.substr(i,cur-i));
DFS(s,prev,i,path,result);
path.pop_back();
}
}
}
};