140. Word Break II

最新推荐文章于 2021-07-24 20:33:45 发布

crazy_jiang

最新推荐文章于 2021-07-24 20:33:45 发布

阅读量284

点赞数

分类专栏： algorithm learning

本文链接：https://blog.csdn.net/a11211058/article/details/53525319

版权

algorithm learning 专栏收录该内容

15 篇文章 0 订阅

订阅专栏

流传最广的方法，先用DP判断是否可以进行分割，再用dfs遍历方案

class Solution {
public:
    string m_str;
    unordered_set<string> m_wordDict;
    vector<string> wordBreak(string s, unordered_set<string>& wordDict) {
        m_str = s;
        m_wordDict = wordDict;
        string now = "";
        vector<string> result;
        result.clear();

        int n = s.length();
        int dictsize = wordDict.size();
        if(dictsize == 0) {
            return result;
        }
        if(n == 0) {
            result.push_back("");
            return result;
        }

        bool f[n + 1];
        f[0] = true;
        for(int i = 1; i <= n; i++) {
            f[i] = false;
            for(int j = 0; j < i; j++) {
                if(f[j] && wordDict.find(s.substr(j,i-j))!=wordDict.end()) {
                    f[i] = true;
                    break;
                }
            }
        }
        if(f[n] == false) {
            return result;
        }

        wordBreakRecursion(result, now, f, 1);
        return result;
    }

    void wordBreakRecursion(vector<string>& result, string now, bool * f,int charnum){
        if(charnum == m_str.length() + 1){
            now = now.substr(0, now.length() - 1);
            result.push_back(now);
            return;
        }
        for(int i = charnum; i <= m_str.length(); i++) {
            //cout<<"f["<<i<<"]="<<f[i]<<" charnum="<<charnum<<endl;
            if(f[i] == true && m_wordDict.find(m_str.substr(charnum - 1, i - charnum + 1))!=m_wordDict.end()) {
                now += m_str.substr(charnum - 1, i - charnum + 1);
                now += " ";
                //cout<<"now = ["<<now<<"]"<<endl;
                wordBreakRecursion(result, now, f, i + 1);
                now = now.substr(0, now.length() - i + charnum - 2);
            }
        }
    }
};