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

思路

动态规划，设f[i]为s中位置第1~i的子串能否被分割，则f[i]=true若k~i子串等于字典中某一单词且f[k-1]==true;否则f[i]=false;

代码

class Solution {
public:
    bool wordBreak(string s, unordered_set<string>& wordDict) {
        vector<bool> dp(s.length()+1,false);//1-N 能否分割
        dp[0]=true;
        for(int i=1;i<=s.length();i++)
        {
            for(auto word:wordDict)
            {
                if(word.length()<=i&&dp[i-word.length()]&&s.substr(i-word.length(),word.length())==word)
                {
                    dp[i]=true;
                    break;
                }
            }
        }
        
        return dp[s.length()];
        
    }
};