Class Solution
java.lang.Object
g2401_2500.s2416_sum_of_prefix_scores_of_strings.Solution
2416 - Sum of Prefix Scores of Strings.<p>Hard</p>
<p>You are given an array <code>words</code> of size <code>n</code> consisting of <strong>non-empty</strong> strings.</p>
<p>We define the <strong>score</strong> of a string <code>word</code> as the <strong>number</strong> of strings <code>words[i]</code> such that <code>word</code> is a <strong>prefix</strong> of <code>words[i]</code>.</p>
<ul>
<li>For example, if <code>words = ["a", "ab", "abc", "cab"]</code>, then the score of <code>"ab"</code> is <code>2</code>, since <code>"ab"</code> is a prefix of both <code>"ab"</code> and <code>"abc"</code>.</li>
</ul>
<p>Return <em>an array</em> <code>answer</code> <em>of size</em> <code>n</code> <em>where</em> <code>answer[i]</code> <em>is the <strong>sum</strong> of scores of every <strong>non-empty</strong> prefix of</em> <code>words[i]</code>.</p>
<p><strong>Note</strong> that a string is considered as a prefix of itself.</p>
<p><strong>Example 1:</strong></p>
<p><strong>Input:</strong> words = [“abc”,“ab”,“bc”,“b”]</p>
<p><strong>Output:</strong> [5,4,3,2]</p>
<p><strong>Explanation:</strong> The answer for each string is the following:</p>
<ul>
<li>
<p>“abc” has 3 prefixes: “a”, “ab”, and “abc”.</p>
</li>
<li>
<p>There are 2 strings with the prefix “a”, 2 strings with the prefix “ab”, and 1 string with the prefix “abc”.</p>
</li>
</ul>
<p>The total is answer[0] = 2 + 2 + 1 = 5.</p>
<ul>
<li>
<p>“ab” has 2 prefixes: “a” and “ab”.</p>
</li>
<li>
<p>There are 2 strings with the prefix “a”, and 2 strings with the prefix “ab”.</p>
</li>
</ul>
<p>The total is answer[1] = 2 + 2 = 4.</p>
<ul>
<li>
<p>“bc” has 2 prefixes: “b” and “bc”.</p>
</li>
<li>
<p>There are 2 strings with the prefix “b”, and 1 string with the prefix “bc”.</p>
</li>
</ul>
<p>The total is answer[2] = 2 + 1 = 3.</p>
<ul>
<li>
<p>“b” has 1 prefix: “b”.</p>
</li>
<li>
<p>There are 2 strings with the prefix “b”.</p>
</li>
</ul>
<p>The total is answer[3] = 2.</p>
<p><strong>Example 2:</strong></p>
<p><strong>Input:</strong> words = [“abcd”]</p>
<p><strong>Output:</strong> [4]</p>
<p><strong>Explanation:</strong></p>
<p>“abcd” has 4 prefixes: “a”, “ab”, “abc”, and “abcd”.</p>
<p>Each prefix has a score of one, so the total is answer[0] = 1 + 1 + 1 + 1 = 4.</p>
<p><strong>Constraints:</strong></p>
<ul>
<li><code>1 <= words.length <= 1000</code></li>
<li><code>1 <= words[i].length <= 1000</code></li>
<li><code>words[i]</code> consists of lowercase English letters.</li>
</ul>
-
Constructor Summary
Constructors -
Method Summary
-
Constructor Details
-
Solution
public Solution()
-
-
Method Details
-
sumPrefixScores
-