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".

 

算法：在网上查到的，动态规划算法

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