Word Break II

最新推荐文章于 2017-07-17 19:50:03 发布

真水壶

最新推荐文章于 2017-07-17 19:50:03 发布

阅读量678

点赞数

CC 4.0 BY-SA版权

分类专栏： leetcode

本文链接：https://blog.youkuaiyun.com/enjoyuseless/article/details/39994039

leetcode 专栏收录该内容

154 篇文章

订阅专栏

本文介绍了一种算法，用于将给定字符串与字典中的单词匹配，实现句子构造并返回所有可能的组合。通过深度优先搜索（DFS）策略，该算法在给定字符串s和字典dict的情况下，找出所有有效的单词序列，从而构建合理的句子。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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, given
s = "catsanddog",
dict = ["cat", "cats", "and", "sand", "dog"].

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

class Solution:
    # @param s, a string
    # @param dict, a set of string
    # @return a list of strings
    def wordBreak(self, s, dict):
        Solution.res = []
        self.dfs(s, dict, '')
        return Solution.res
        
    def dfs(self, s, dict, stringlist):
        if self.isBreak(s, dict):
            if len(s) == 0: 
                Solution.res.append(stringlist[1:])
            for i in range(1, len(s)+1):
                if s[:i] in dict:
                    self.dfs(s[i:], dict, stringlist+' '+s[:i])
    
        
    def isBreak(self,s,word_dict):
        mark = [ False for i in range(len(s)+1) ]
        mark[0]=True
        for i in range(1,len(s)+1):
            for j in range(0,i):
                if mark[j] and s[j:i] in word_dict:
                    mark[i]=True
                    break
        return mark[-1]