首页 > 代码库 > Word Break
Word Break
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()]; } };
声明：以上内容来自用户投稿及互联网公开渠道收集整理发布，本网站不拥有所有权，未作人工编辑处理，也不承担相关法律责任，若内容有误或涉及侵权可进行投诉： 投诉/举报 工作人员会在5个工作日内联系你，一经查实，本站将立刻删除涉嫌侵权内容。