140. Word Break II

最新推荐文章于 2022-02-19 19:01:58 发布

xdhc304

最新推荐文章于 2022-02-19 19:01:58 发布

阅读量192

点赞数

分类专栏： leetcode 文章标签： leetcode-java

本文链接：https://blog.csdn.net/xdhc304/article/details/79261179

版权

leetcode 专栏收录该内容

599 篇文章 0 订阅

订阅专栏

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. You may assume the dictionary does not contain duplicate words.

Return all such possible sentences.

For example, given
s = “catsanddog”,
dict = [“cat”, “cats”, “and”, “sand”, “dog”].

A solution is [“cats and dog”, “cat sand dog”].

UPDATE (2017/1/4):
The wordDict parameter had been changed to a list of strings (instead of a set of strings). Please reload the code definition to get the latest changes.

class Solution {
    public List<String> wordBreak(String s, List<String> wordDict) {
        return dfs(s, wordDict, new HashMap<String, List<String>>());
    }

    public List<String> dfs(String s, List<String> wordDict, HashMap<String, List<String>> memo){
        // 记忆化搜索，可以减少重复部分的操作，直接得到break后的结果。
        if(memo.containsKey(s)){
            return memo.get(s);
        }

        int n = s.length();
        List<String> list = new ArrayList<String>();
        for(String word: wordDict){
            // 如果这个单词可以作为开头，把剩下的部分作为完全相同的子问题。
            // 得到的结果和这个单词组合在一起得到结果。
            if(!s.startsWith(word)) 
                continue;

            int len = word.length();
            if(len == n){
                list.add(word);
            } else {
                List<String> sublist = dfs(s.substring(len), wordDict, memo);
                for(String item: sublist){
                    list.add(word + " " + item);
                }
            }
        }

        memo.put(s, list);
        return list;
    }
}