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.
For example, given
s = "catsanddog"
,
dict = ["cat", "cats", "and", "sand", "dog"]
.
A solution is ["cats and dog", "cat sand dog"]
.
这道题的思路和word break I 类似,大体上分为三步。单独拎出来看每一步其实都很简单.
1. 建立一个DP,与word break I不同的是,这里的DP是一个vector<vector<string>>,每一个元素是一个vector<string> 记录了到这里为止,是否可以用字典里面的单词构成一个字符串,并且构成了每一个到达这步的word。比如s= "catsandog", 共有9个单词。所以dp[9] = {"dog"},因为字符串的结尾是通过dog到达第九个单词这一步的。dp[7] = {sand,and},因为通过and和sand同时到达这里。
2.dfs,当构成dp之后,我们要traverse所有的构成完整字符串的可能,很简单的一个dfs,不过这里因为要从尾部遍历,所以每次插入新的字符串都是要从头插入,所以这里我们没用vector,用了list。 于是完整的结果应该是一个vector<list<string>>。
3.把list<string> 重写改成一个string。
代码如下:
class Solution {
public:
vector<string> wordBreak(string s, unordered_set<string>& wordDict) {
//generate dp
vector<vector<string>> dp = generate(s,wordDict);
//dfs
vector<list<string>> result;
list<string> solu;
dfs(result, solu, dp, s.size());
//generate according formula
vector<string> res = wordbreak(result);
return res;
}
private:
vector<string> wordbreak(vector<list<string>> &result) {
vector<string> wordbreak;
for (int i = 0; i < result.size(); i++) {
string tmp;
for (auto word:result[i]) {
tmp += word+" ";
}
tmp.pop_back();
wordbreak.push_back(tmp);
}
return wordbreak;
}
void dfs(vector<list<string>> &result,list<string>& solu,vector<vector<string>> &dp,int idx) {
if (idx == 0) {
result.push_back(solu);
return;
}
for (int i = 0; i < dp[idx].size(); i++) {
string word = dp[idx][i];
solu.push_front(word);
dfs(result,solu,dp,idx-word.size());
solu.pop_front();
}
}
vector<vector<string>> generate(string s,unordered_set<string> &wordDict) {
vector<vector<string>> dp(s.size()+1);
dp[0].push_back("-1");
for (int i = 1; i <= s.size(); i++) {
if (!dp[i-1].empty()) {
for (auto &word:wordDict) {
if (word == s.substr(i-1,word.size()))
dp[i-1+word.size()].push_back(word);
}
}
}
return dp;
}
};