首页 > 代码库 > Leetcode:Word Break 字符串分解为单词
Leetcode: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, givens = "leetcode",dict = ["leet", "code"].Return true because "leetcode" can be segmented as "leet code".
解题分析:注意词典中的每个单词可以多用,比如 s = "bb" dict = ["a", "b"]需要返回true
class Solution {public: bool wordBreak(string s, unordered_set<string> &dict) { std::vector<bool> dp(s.size() + 1, false); dp[0] = true; for (int i = 1; i <= s.size(); ++i) { for (int j = i - 1; j >= 0; --j) { std::string str = s.substr(j, i - j); if (dp.at(j) == true && dict.find(str) != dict.end()) { dp.at(i) = true; } } } return dp.at(s.size()); }};
Word Break II
Given a string s and a dictionary of words dict, add spaces in s to construct a sentence where each word is a valid dictionary word.Return all such possible sentences.For example, givens = "catsanddog",dict = ["cat", "cats", "and", "sand", "dog"].A solution is ["cats and dog", "cat sand dog"].
Leetcode:Word Break 字符串分解为单词
声明:以上内容来自用户投稿及互联网公开渠道收集整理发布,本网站不拥有所有权,未作人工编辑处理,也不承担相关法律责任,若内容有误或涉及侵权可进行投诉: 投诉/举报 工作人员会在5个工作日内联系你,一经查实,本站将立刻删除涉嫌侵权内容。