word-break
时间限制:1秒 空间限制:32768K 热度指数:23533
本题知识点: 动态规划 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".