给定一个非空字符串 s 和一个包含非空单词列表的字典 wordDict,在字符串中增加空格来构建一个句子,使得句子中所有的单词都在词典中。返回所有这些可能的句子。
说明:
- 分隔时可以重复使用字典中的单词。
- 你可以假设字典中没有重复的单词。
示例 1:
输入:
s = "catsanddog"
wordDict = ["cat", "cats", "and", "sand", "dog"]
输出:
[
"cats and dog",
"cat sand dog"
]
示例 2:
输入:
s = "pineapplepenapple"
wordDict = ["apple", "pen", "applepen", "pine", "pineapple"]
输出:
[
"pine apple pen apple",
"pineapple pen apple",
"pine applepen apple"
]
解释: 注意你可以重复使用字典中的单词。
示例 3:
输入:
s = "catsandog"
wordDict = ["cats", "dog", "sand", "and", "cat"]
输出:
[]
解答
递归+回溯,可惜超时:
class Solution {
public:
vector<string> result;
vector<string> wordBreak(string s, vector<string>& wordDict) {
set<string> wordSet(wordDict.begin(), wordDict.end());
vector<string> wordVec;
helper(s, wordSet, 0, 1, wordVec);
return result;
}
void helper(string s, set<string>& wordSet, int pos, int len, vector<string>& wordVec){
if(pos + len > s.size())
return;
string temp = s.substr(pos, len);
if(wordSet.find(temp) != wordSet.end()){
wordVec.push_back(temp);
if(pos + len == s.size()){
auto s = concat(wordVec);
if(find(result.begin(), result.