前往小程序,Get更优阅读体验!
立即前往
首页
学习
活动
专区
工具
TVP
发布
社区首页 >专栏 >LeetCode 0140 - Word Break II

LeetCode 0140 - Word Break II

作者头像
Reck Zhang
发布2021-08-11 14:47:26
1710
发布2021-08-11 14:47:26
举报
文章被收录于专栏:Reck Zhang

Word Break II

Desicription

Given a non-empty string s and a dictionary wordDict containing a list of non-empty words, add spaces in s to construct a sentence where each word is a valid dictionary word. Return all such possible sentences.

Note:

  • The same word in the dictionary may be reused multiple times in the segmentation.
  • You may assume the dictionary does not contain duplicate words.

Example 1:

代码语言:javascript
复制
Input:
s = "catsanddog"
wordDict = ["cat", "cats", "and", "sand", "dog"]
Output:
[
  "cats and dog",
  "cat sand dog"
]

Example 2:

代码语言:javascript
复制
Input:
s = "pineapplepenapple"
wordDict = ["apple", "pen", "applepen", "pine", "pineapple"]
Output:
[
  "pine apple pen apple",
  "pineapple pen apple",
  "pine applepen apple"
]
Explanation: Note that you are allowed to reuse a dictionary word.

Example 3:

代码语言:javascript
复制
Input:
s = "catsandog"
wordDict = ["cats", "dog", "sand", "and", "cat"]
Output:
[]

Solution

代码语言:javascript
复制
class Solution {
private:
    unordered_map<string, vector<string>> mp; 
    unordered_set<string> dict;
    vector<string> combine(string s, vector<string> vec) {
        for(int i = 0; i < vec.size(); i++)
            vec[i] += " " + s;
        return vec;
    }
    vector<string> dfs(string s) {
        if(mp.count(s))
            return mp[s];
        vector<string> res;
        if(dict.count(s))
            res.push_back(s);
        for(int i = 1; i < s.size(); i++) {
            string word = s.substr(i);
            if(dict.count(word)) {
                string rem = s.substr(0, i);
                vector<string> prev = combine(word, dfs(rem));
                res.insert(res.end(), prev.begin(), prev.end());
            }
        }
        mp[s] = res;
        return res;
    }
public:
    vector<string> wordBreak(string s, vector<string>& wordDict) {
        dict = unordered_set<string>(wordDict.begin(), wordDict.end());
        return dfs(s);
    }
};
本文参与 腾讯云自媒体同步曝光计划,分享自作者个人站点/博客。
原始发表:2018-05-29,如有侵权请联系 cloudcommunity@tencent.com 删除

本文分享自 作者个人站点/博客 前往查看

如有侵权,请联系 cloudcommunity@tencent.com 删除。

本文参与 腾讯云自媒体同步曝光计划  ,欢迎热爱写作的你一起参与!

评论
登录后参与评论
0 条评论
热度
最新
推荐阅读
目录
  • Word Break II
    • Desicription
      • Solution
      领券
      问题归档专栏文章快讯文章归档关键词归档开发者手册归档开发者手册 Section 归档