本文探讨了一个经典的字符串处理问题：如何判断一个字符串能否被拆分成一个或多个字典中出现的单词序列。通过一个具体示例，即利用给定的字典判断字符串'leetcode'是否能被正确分割。
Given a string s and a dictionary of words dict, determine if s can be segmented into a space-separated sequence of one or more dictionary words.
For example, given
s = "leetcode",
dict = ["leet", "code"].
Return true because "leetcode" can be segmented as "leet
code".
{优快云:CODE:465568}
扫一扫
1万+
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
