LeetCode 140. Word Break II - 前缀树（Trie Tree or Prefix Tree）系列题3

最新推荐文章于 2024-10-16 10:13:45 发布

CP Coding

最新推荐文章于 2024-10-16 10:13:45 发布

阅读量256

点赞数 2

分类专栏： Leetcode刷题笔记前缀树（Trie Tree or Prefix Tree）文章标签： leetcode 算法数据结构 python 树结构

本文链接：https://blog.csdn.net/hgq522/article/details/121739043

版权

给定一个字符串和一个单词字典，构造所有可能的句子，使得每个单词都是字典中的有效单词。题目要求找出所有可能的分割方法，可以使用前缀树（Trie Tree）解决。通过扫描字符串并寻找前缀，找到完整单词后，将剩余部分继续作为新字符串进行匹配，直至找到所有可能的分割组合。

摘要由CSDN通过智能技术生成

Given a string s and a dictionary of strings wordDict, add spaces in s to construct a sentence where each word is a valid dictionary word. Return all such possible sentences in any order.

Note that the same word in the dictionary may be reused multiple times in the segmentation.

Example 1:

Input: s = "catsanddog", wordDict = ["cat","cats","and","sand","dog"]
Output: ["cats and dog","cat sand dog"]

Example 2:

Input: s = "pineapplepenapple", wordDict = ["apple","pen","applepen","pine","pineapple"]
Output: ["pine apple pen apple","pineapple pen apple","pine applepen apple"]
Explanation: Note that you a