Class Solution
java.lang.Object
g1201_1300.s1255_maximum_score_words_formed_by_letters.Solution
1255 - Maximum Score Words Formed by Letters.<p>Hard</p>
<p>Given a list of <code>words</code>, list of single <code>letters</code> (might be repeating) and <code>score</code> of every character.</p>
<p>Return the maximum score of <strong>any</strong> valid set of words formed by using the given letters (<code>words[i]</code> cannot be used two or more times).</p>
<p>It is not necessary to use all characters in <code>letters</code> and each letter can only be used once. Score of letters <code>'a'</code>, <code>'b'</code>, <code>'c'</code>, … ,<code>'z'</code> is given by <code>score[0]</code>, <code>score[1]</code>, … , <code>score[25]</code> respectively.</p>
<p><strong>Example 1:</strong></p>
<p><strong>Input:</strong> words = [“dog”,“cat”,“dad”,“good”], letters = [“a”,“a”,“c”,“d”,“d”,“d”,“g”,“o”,“o”], score = [1,0,9,5,0,0,3,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0]</p>
<p><strong>Output:</strong> 23</p>
<p><strong>Explanation:</strong></p>
<p>Score a=1, c=9, d=5, g=3, o=2</p>
<p>Given letters, we can form the words “dad” (5+1+5) and “good” (3+2+2+5) with a score of 23.</p>
<p>Words “dad” and “dog” only get a score of 21.</p>
<p><strong>Example 2:</strong></p>
<p><strong>Input:</strong> words = [“xxxz”,“ax”,“bx”,“cx”], letters = [“z”,“a”,“b”,“c”,“x”,“x”,“x”], score = [4,4,4,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,5,0,10]</p>
<p><strong>Output:</strong> 27</p>
<p><strong>Explanation:</strong></p>
<p>Score a=4, b=4, c=4, x=5, z=10</p>
<p>Given letters, we can form the words “ax” (4+5), “bx” (4+5) and “cx” (4+5) with a score of 27.</p>
<p>Word “xxxz” only get a score of 25.</p>
<p><strong>Example 3:</strong></p>
<p><strong>Input:</strong> words = [“leetcode”], letters = [“l”,“e”,“t”,“c”,“o”,“d”], score = [0,0,1,1,1,0,0,0,0,0,0,1,0,0,1,0,0,0,0,1,0,0,0,0,0,0]</p>
<p><strong>Output:</strong> 0</p>
<p><strong>Explanation:</strong> Letter “e” can only be used once.</p>
<p><strong>Constraints:</strong></p>
<ul>
<li><code>1 <= words.length <= 14</code></li>
<li><code>1 <= words[i].length <= 15</code></li>
<li><code>1 <= letters.length <= 100</code></li>
<li><code>letters[i].length == 1</code></li>
<li><code>score.length == 26</code></li>
<li><code>0 <= score[i] <= 10</code></li>
<li><code>words[i]</code>, <code>letters[i]</code> contains only lower case English letters.</li>
</ul>
-
Constructor Summary
Constructors -
Method Summary
-
Constructor Details
-
Solution
public Solution()
-
-
Method Details
-
maxScoreWords
-