LeetCode – Refresh – Word Break

Differentiate it with Palindrome min cut!!!!!!!!!

class Solution {
public:
    bool wordBreak(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;
                    
                }
            }
        }
        return dp[len];
    }
};