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