【面试准备】letcode-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 n = (int)s.size();  
        vector<bool> dp(n + 1, false);  
        dp[0]=true;  
        for(int i=1;i <= n;i++)  
        {  
            if(dp[i-1])  
            {  
                int idx= i-1;  
                for(int j=idx;j<n;j++)  
                {  
                    string cur=s.substr(idx,j-idx+1);  
                    if(dict.count(cur)>0)  
                        dp[j+1]=true;  
                }  
            }  
        }  
        return dp[n];  
    } 
};