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 = s.length(); vector<bool> dp(n + 1, false); dp[0] = true; for(int i = 1; i <= n; i++){ for(int j = 0; j < i; j++){ if(dp[j]==true && dict.find(s.substr(j, i-j)) != dict.end()){ dp[i] = true; break; } } } return dp[n]; } };
原文：http://www.cnblogs.com/code-swan/p/4139677.html