leedcode 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 自底向上维护bool类型数组bol，当bol[i]为1 表示0-i之间的字符串可以被划分。加入假头结点方便循环体执行。

递推公式

bol[i] = true     if   bol[k] == true 并且 s[k+1,i]在dictionary里面， 0=<k<i(注意k是尝试划分点，k=0就是不做划分)
                            = false    if    no such k exist.(也就是所有的划分都无法满足segment的条件)

class Solution {
public:
    bool wordBreak(string s, unordered_set<string> &dict){
        s = "#"+s;//加入dummy头结点，方便后续循环体的执行
        int len = s.length();
        //bool[] bol = new bool[n];
        bool bol[len];
        memset(bol,0,sizeof(bool)*len);
        bol[0] = 1;
        for(int i=1;i<len;i++){
            for(int k=0;k<i;k++){
                //bol[i] = bol[k]&&(dict.find(s.substr(k+1,i-k))!=dict.end());//find return an iterator of unorder_set
                bol[i] = bol[k]&&dict.count(s.substr(k+1,i-k));//unorder_set::count return the value of the string only return 0,1
                if(bol[i]) break;
            }
        }
        return bol[len-1];
    }
};