2022-03-27 18:35:17 +08:00
< p > Given a string < code > s< / code > and a dictionary of strings < code > wordDict< / code > , return < code > true< / code > if < code > s< / code > can be segmented into a space-separated sequence of one or more dictionary words.< / p >
< p > < strong > Note< / strong > that the same word in the dictionary may be reused multiple times in the segmentation.< / p >
< p > < / p >
2023-12-09 18:42:21 +08:00
< p > < strong class = "example" > Example 1:< / strong > < / p >
2022-03-27 18:35:17 +08:00
< pre >
< strong > Input:< / strong > s = " leetcode" , wordDict = [" leet" ," code" ]
< strong > Output:< / strong > true
< strong > Explanation:< / strong > Return true because " leetcode" can be segmented as " leet code" .
< / pre >
2023-12-09 18:42:21 +08:00
< p > < strong class = "example" > Example 2:< / strong > < / p >
2022-03-27 18:35:17 +08:00
< pre >
< strong > Input:< / strong > s = " applepenapple" , wordDict = [" apple" ," pen" ]
< strong > Output:< / strong > true
< strong > Explanation:< / strong > Return true because " applepenapple" can be segmented as " apple pen apple" .
Note that you are allowed to reuse a dictionary word.
< / pre >
2023-12-09 18:42:21 +08:00
< p > < strong class = "example" > Example 3:< / strong > < / p >
2022-03-27 18:35:17 +08:00
< pre >
< strong > Input:< / strong > s = " catsandog" , wordDict = [" cats" ," dog" ," sand" ," and" ," cat" ]
< strong > Output:< / strong > false
< / pre >
< p > < / p >
< p > < strong > Constraints:< / strong > < / p >
< ul >
< li > < code > 1 < = s.length < = 300< / code > < / li >
< li > < code > 1 < = wordDict.length < = 1000< / code > < / li >
< li > < code > 1 < = wordDict[i].length < = 20< / code > < / li >
< li > < code > s< / code > and < code > wordDict[i]< / code > consist of only lowercase English letters.< / li >
< li > All the strings of < code > wordDict< / code > are < strong > unique< / strong > .< / li >
< / ul >
