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"]
.
DFS的过程中,如果dp[idx + len]=true并且dict.count(s.substr(idx, len)) > 0 (idx从0开始递增,len从1开始递增),那么就将s[idx, idx+len]加入到结果集。
这意思是s[0...idx+len]能够被字典合成,然后s[idx, idx+len]也能被字典合成(即s[0, idx]也能被字典合成,但是因为循环从0开始,所以这部分substr已经在结果中 )
void breakWord(vector<string> &res, string &s, unordered_set<string> &dict, string str, int idx, vector<bool> &dp)
{
string substr;
for (int len = 1; idx + len < s.length() + 1; ++len)
{
if (dp[idx + len] && dict.count(s.substr(idx,len)) > 0)
{
substr = s.substr(idx, len);
if (idx + len < s.length())
{
breakWord(res, s, dict, str + substr + " ", idx + len, dp);
}
else
{
res.push_back(str + substr);
}
}
}
}
vector<string> wordBreak(string s, unordered_set<string> &dict)
{
vector<bool> dp(s.length() + 1, false);
dp[0] = true;
for (int i = 0; i < s.length(); ++i)
{
if (dp[i])
{
for (int len = 1; i + len < s.length() + 1; ++len)
{
if (dict.count(s.substr(i, len)) > 0)
{
dp[i + len] = true;
}
}
}
}
vector<string> res;
if (dp[s.length()])
breakWord(res, s, dict, "", 0, dp);
return res;
}