Word Break

题目：

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.

Note:

• The same word in the dictionary may be reused multiple times in the segmentation.
• You may assume the dictionary does not contain duplicate words.

Example 1:

Input: s = "leetcode", wordDict = ["leet", "code"]
Output: true
Explanation: Return true because "leetcode" can be segmented as "leet code".

Example 2:

Input: s = "applepenapple", wordDict = ["apple", "pen"]
Output: true
Explanation: Return true because "applepenapple" can be segmented as "apple pen apple".
             Note that you are allowed to reuse a dictionary word.

Example 3:

Input: s = "catsandog", wordDict = ["cats", "dog", "sand", "and", "cat"]
Output: false

解析：

此题可以用动态规划来解决，dp[i]表示字符串长度为i时是否可以分解成wordDict里面的单词，如果可以则dp[i]=true，否则dp[i]=false。

代码：

class Solution {
public:
    bool wordBreak(string s, vector<string>& wordDict) {
        int len = s.size();
        vector<bool> dp(len+1, false);
        dp[0] = true;
        for(int i = 1; i <= len; ++i)//i表示字符串的长度
        {
            for(int j = i - 1; j >= 0; --j)
            {
            	/*
            	如果dp[j]为false，说明前面j长度的字符串不能分解成wordDict，这是在判断从j开始长度为i-j字符串的单词是否在wordDict里面已经没有意思
            	*/
                if(dp[j])
                {
                    string str = s.substr(j,i-j);
                    auto ite1 = find(wordDict.begin(), wordDict.end(), str);
                    if(ite1 != wordDict.end())
                    {
                        dp[i] = true;
                        break;
                    }
                }
            }
        }
        return dp[len];
    }
};