Leetcode之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

代码：

class Solution {
public:
    bool wordBreak(string s, vector<string>& wordDict) {
       int len = s.length();
	bool * b = new bool[len+1];
	b[0] = true;
	for (int i = 1; i <= len; i++) {
		int total = 0;
		for (int j = 1; j <= i; j++) {
			if (!b[j - 1])continue;
			int res = std::count(wordDict.begin(), wordDict.end(), s.substr(j-1, i - j + 1));
			if (res > 0) {
				
					b[i] = true;
					total++;
					break;
			}
			
		}
		if (total == 0)b[i] = false;
	}

	bool re = b[len ];
    delete [] b;
	return re;
    }
};