LeetCode 139. Word Break - 前缀树（Trie Tree or Prefix Tree）系列题2

CP Coding

于 2021-12-06 01:22:39 发布

阅读量432

点赞数 1

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

本文链接：https://blog.youkuaiyun.com/hgq522/article/details/121738516

版权

该博客介绍了如何利用前缀树（Trie Tree）解决LeetCode上的139题，即判断一个字符串能否被字典中的单词分割。通过创建Trie并遍历字符串，检查每个前缀是否为字典中的单词，同时记录无效的剩余部分以避免重复计算，以提高效率。虽然动态规划也是可行解法，但本文侧重于Trie的实现。

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

Given a string s and a dictionary of strings wordDict, return true if s can be segmented into a space-separated sequence of one or more dictionary words.

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

Example 1:

Input: s = "leetcode", wordDict = ["leet","code"]
Output: true
Explanation: Return true because "leetcode" can be segmented as "leet code".

Example 2:

Input: s = "applepenapple", wordDict = ["apple","pen"]
Output: true
Explanation: Return true because "applepenapple" can be segmented as "apple pen apple".
Note that you are allowed to reuse a dictionary word.

Exa