Package g0101_0200.s0139_word_break

Class Solution

java.lang.Object
g0101_0200.s0139_word_break.Solution
public class Solution extends Object
139 - Word Break.<p>Medium</p> <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><strong>Example 1:</strong></p> <p><strong>Input:</strong> s = &ldquo;leetcode&rdquo;, wordDict = [&ldquo;leet&rdquo;,&ldquo;code&rdquo;]</p> <p><strong>Output:</strong> true</p> <p><strong>Explanation:</strong> Return true because &ldquo;leetcode&rdquo; can be segmented as &ldquo;leet code&rdquo;.</p> <p><strong>Example 2:</strong></p> <p><strong>Input:</strong> s = &ldquo;applepenapple&rdquo;, wordDict = [&ldquo;apple&rdquo;,&ldquo;pen&rdquo;]</p> <p><strong>Output:</strong> true</p> <p><strong>Explanation:</strong> Return true because &ldquo;applepenapple&rdquo; can be segmented as &ldquo;apple pen apple&rdquo;. Note that you are allowed to reuse a dictionary word.</p> <p><strong>Example 3:</strong></p> <p><strong>Input:</strong> s = &ldquo;catsandog&rdquo;, wordDict = [&ldquo;cats&rdquo;,&ldquo;dog&rdquo;,&ldquo;sand&rdquo;,&ldquo;and&rdquo;,&ldquo;cat&rdquo;]</p> <p><strong>Output:</strong> false</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>

  • Constructor Details

    • Solution

      public Solution()

  • Method Details