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解法：
对于s中（0，i）之间的字符：
1.若t=s.substr(0,i)在字典中，则dp[i]=true;
2.若t=s.substr(0,i)不在字典中
则对(0,i)之间的dp[ j ]( j > =1 && j < i )=1，则对t1=s.substr（j,i-j)判断是否在字典中，若在字典中则dp[i]=true;

 bool wordBreak(string s, unordered_set<string>& wordDict)
  {

        int n=s.length();
        if(n==0)
        {
            return false;
        }
        vector<bool> bp(n+1,false);
        for(int i=1;i<=n;++i)
        {
            string t=s.substr(0,i);
            bp[i]=wordDict.find(t)!=wordDict.end()?true:false;
            if(bp[i])
            {
                continue;
            }
            else
            {
                for(int j=1;j<i;++j)
                {
                    if(bp[j])
                    {
                         string t1=s.substr(j,i-j);
                         bp[i]=wordDict.find(t1)!=wordDict.end()?true:false;
                         if(bp[i])
                         {
                             break;
                         }
                    }

                }
            }
        }


        return bp[n];
 }