[leetcode]Word Break

Given a string s and a dictionary of words dict, determine if s can be segmented into a space-separated sequence of one or more dictionary words.

For example, given
s = “leetcode”,
dict = [“leet”, “code”].

Return true because “leetcode” can be segmented as “leet code”.

DP 在每个字母之间插空。

class Solution {
public:
    bool wordBreak(string s, unordered_set<string> &dict) {
        int  n = s.length();
        bool dp[n+1];
        memset(dp,false,n+1);
        dp[0] = true;
        for(int i=0;i<n+1;i++){
            for(int j=0;j<i;j++){
                if(dp[j]&& dict.find(s.substr(j,i-j))!= dict.end()){
                    dp[i] = true;
                    break;
                }
            }
        }
        return dp[n];

    }
};