Class Solution
java.lang.Object
g2701_2800.s2707_extra_characters_in_a_string.Solution
2707 - Extra Characters in a String.<p>Medium</p>
<p>You are given a <strong>0-indexed</strong> string <code>s</code> and a dictionary of words <code>dictionary</code>. You have to break <code>s</code> into one or more <strong>non-overlapping</strong> substrings such that each substring is present in <code>dictionary</code>. There may be some <strong>extra characters</strong> in <code>s</code> which are not present in any of the substrings.</p>
<p>Return <em>the <strong>minimum</strong> number of extra characters left over if you break up</em> <code>s</code> <em>optimally.</em></p>
<p><strong>Example 1:</strong></p>
<p><strong>Input:</strong> s = “leetscode”, dictionary = [“leet”,“code”,“leetcode”]</p>
<p><strong>Output:</strong> 1</p>
<p><strong>Explanation:</strong> We can break s in two substrings: “leet” from index 0 to 3 and “code” from index 5 to 8. There is only 1 unused character (at index 4), so we return 1.</p>
<p><strong>Example 2:</strong></p>
<p><strong>Input:</strong> s = “sayhelloworld”, dictionary = [“hello”,“world”]</p>
<p><strong>Output:</strong> 3</p>
<p><strong>Explanation:</strong> We can break s in two substrings: “hello” from index 3 to 7 and “world” from index 8 to 12. The characters at indices 0, 1, 2 are not used in any substring and thus are considered as extra characters. Hence, we return 3.</p>
<p><strong>Constraints:</strong></p>
<ul>
<li><code>1 <= s.length <= 50</code></li>
<li><code>1 <= dictionary.length <= 50</code></li>
<li><code>1 <= dictionary[i].length <= 50</code></li>
<li><code>dictionary[i]</code> and <code>s</code> consists of only lowercase English letters</li>
<li><code>dictionary</code> contains distinct words</li>
</ul>
-
Constructor Summary
Constructors -
Method Summary
-
Constructor Details
-
Solution
public Solution()
-
-
Method Details
-
minExtraChar
-