难度困难224收藏分享切换为英文关注反馈
给定一个非空字符串 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"] 输出: []
先用DP判断是否存在,再用DFS遍历
class Solution {
vector<vector<int>> _wordBreakIter(string const& s, unordered_set<string> const& wordDict){
int n = s.size();
vector<vector<int>> wordSplit(n+1);
wordSplit[n].push_back(-1);
for (int i=n-1;i>=0 ;--i) {
for(int j=i;j<=n-1;++j){
if(wordDict.count(s.substr(i,j-i+1)) && !wordSplit[j+1].empty()){
wordSplit[i].push_back(j);
}
}
}
wordSplit.pop_back();
return wordSplit;
}
vector<string> ans;
void getVecStr(string const& s,vector<vector<int>> const& wordSplit,int pos,string cur_str){
if(pos>=s.size()){
ans.push_back(cur_str.substr(1));
return;
}
if(wordSplit[pos].empty()) return;
for(auto i : wordSplit[pos]){
getVecStr(s,wordSplit,i+1,cur_str+" "+s.substr(pos,i-pos+1));
}
}
public:
vector<string> wordBreak(string s, vector<string>& wordDict) {
if(s.empty() || wordDict.empty()) return ans;
unordered_set<string> wordSet(wordDict.begin(),wordDict.end());
int n =s.size();
auto&& wordSplit=_wordBreakIter(s,wordSet);
getVecStr(s,wordSplit,0,"");
return ans;
}
};