首页 > 代码库 > 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".
Analyse: Use dynamic programming to solve this problem.
1 class Solution { 2 public: 3 bool wordBreak(string s, unordered_set<string>& wordDict) { 4 vector<bool> canDivide(s.size() + 1, false); 5 canDivide[0] = true; 6 7 for (int i = 0; i < s.size(); i++) { 8 for (int j = i; j >= 0; j--) { 9 if (canDivide[i - j] && wordDict.find(s.substr(i - j, j + 1)) != wordDict.end()) {10 canDivide[i + 1] = true;11 break;12 }13 }14 }15 return canDivide[s.size()];16 }17 };
Word Break
声明：以上内容来自用户投稿及互联网公开渠道收集整理发布，本网站不拥有所有权，未作人工编辑处理，也不承担相关法律责任，若内容有误或涉及侵权可进行投诉： 投诉/举报 工作人员会在5个工作日内联系你，一经查实，本站将立刻删除涉嫌侵权内容。