LeetCode – Refresh – Word Break II

Do not confused with min cut again!!!!!!!!!!!!

class Solution {
public:
    bool canBreak(string s, unordered_set<string> &dict) {
        int len = s.size();
        if (len == 0) return false;
        vector<bool> dp(len+1, false);
        dp[0] = true;
        for (int i = 1; i <= len; i++) {
            for (int j = i-1; j >= 0; j--) {
                if (dp[j] && dict.find(s.substr(j, i-j)) != dict.end()) {
                    dp[i] = true;
                    break;
                }
            }
        }
        return dp[len];
    }
    void getBreak(vector<string> &result, string s, string current, unordered_set<string> dict, int index) {
        if (index == s.size()) {
            result.push_back(current);
            return;
        }
        if (index != 0) current += ' ';
        for (int i = index; i < s.size(); i++) {
            if (dict.find(s.substr(index, i - index+1)) != dict.end()) {
                getBreak(result, s, current + s.substr(index, i - index+1), dict, i+1);
            }
        }
    }
    vector<string> wordBreak(string s, unordered_set<string> &dict) {
        vector<string> result;
        if (!canBreak(s, dict))  return result;
        getBreak(result, s, "", dict, 0);
        return result;
    }
};