【Leetcode】139. Word Break

Description:

Given a non-empty string s and a dictionary wordDict containing a list of non-empty words, determine if s can be segmented into a space-separated sequence of one or more dictionary words. You may assume the dictionary does not contain duplicate words.

Example:

Given
s = “leetcode”,
dict = [“leet”, “code”].

Return true because “leetcode” can be segmented as “leet code”.

UPDATE (2017/1/4):
The wordDict parameter had been changed to a list of strings (instead of a set of strings). Please reload the code definition to get the latest changes.

思路：

对于该问题，无非就是在给定的字符串中找到一种分词的方式，而所要分的词需要是字典里含有的。本题可以用动态规划来解决。由于本题只需要判断字符串s能否进行分词，那么目标函数应该返回一个布尔值。可以定义f[j]为字符串s的前j个字符是否可以进行分词，那么求出f[s.length()]的值即可。f[0]表示字符串为空，此时其返回值应为true。f[1]到f[s.length()]的值都置为false。
对于字符串s的前j个字符能否进行分词，需要从0开始到j查找，再从i到j截取s的子串，来匹配字典里面的词，判断能否进行分词，即dist.find(s(i, j))。状态转移方程为f[j] = f[j] && dist.find(s(i, j))。

以下是C++的实现过程：

class Solution {
public:
    bool wordBreak(string s, vector<string>& wordDict) {
        vector<bool> f(s.length()+1, false);  
        f[0] = true;  //当字符串为空时
        for (int i=1; i<s.length()+1; i++){  
            for (int j=i-1; j>=0; j--){  
                if (f[j] && find(wordDict.begin(),wordDict.end(),s.substr(j, i-j)) != wordDict.end()){  
                    f[i] = true;  
                    break;   
                }  
            }  
        }  
        return f[s.length()];  
    }  
};