mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-01-11 02:58:13 +08:00
45 lines
2.4 KiB
HTML
45 lines
2.4 KiB
HTML
|
<p>You are <strong>building</strong> a string <code>s</code> of length <code>n</code> <strong>one</strong> character at a time, <strong>prepending</strong> each new character to the <strong>front</strong> of the string. The strings are labeled from <code>1</code> to <code>n</code>, where the string with length <code>i</code> is labeled <code>s<sub>i</sub></code>.</p>
|
||
|
|
|
||
|
|
<ul>
|
||
|
|
<li>For example, for <code>s = "abaca"</code>, <code>s<sub>1</sub> == "a"</code>, <code>s<sub>2</sub> == "ca"</code>, <code>s<sub>3</sub> == "aca"</code>, etc.</li>
|
||
|
|
</ul>
|
||
|
|
|
||
|
|
<p>The <strong>score</strong> of <code>s<sub>i</sub></code> is the length of the <strong>longest common prefix</strong> between <code>s<sub>i</sub></code> and <code>s<sub>n</sub></code> (Note that <code>s == s<sub>n</sub></code>).</p>
|
||
|
|
|
||
|
|
<p>Given the final string <code>s</code>, return<em> the <strong>sum</strong> of the <strong>score</strong> of every </em><code>s<sub>i</sub></code>.</p>
|
||
|
|
|
||
|
|
<p> </p>
|
||
|
|
<p><strong>Example 1:</strong></p>
|
||
|
|
|
||
|
|
<pre>
|
||
|
|
<strong>Input:</strong> s = "babab"
|
||
|
|
<strong>Output:</strong> 9
|
||
|
|
<strong>Explanation:</strong>
|
||
|
|
For s<sub>1</sub> == "b", the longest common prefix is "b" which has a score of 1.
|
||
|
|
For s<sub>2</sub> == "ab", there is no common prefix so the score is 0.
|
||
|
|
For s<sub>3</sub> == "bab", the longest common prefix is "bab" which has a score of 3.
|
||
|
|
For s<sub>4</sub> == "abab", there is no common prefix so the score is 0.
|
||
|
|
For s<sub>5</sub> == "babab", the longest common prefix is "babab" which has a score of 5.
|
||
|
|
The sum of the scores is 1 + 0 + 3 + 0 + 5 = 9, so we return 9.</pre>
|
||
|
|
|
||
|
|
<p><strong>Example 2:</strong></p>
|
||
|
|
|
||
|
|
<pre>
|
||
|
|
<strong>Input:</strong> s = "azbazbzaz"
|
||
|
|
<strong>Output:</strong> 14
|
||
|
|
<strong>Explanation:</strong>
|
||
|
|
For s<sub>2</sub> == "az", the longest common prefix is "az" which has a score of 2.
|
||
|
|
For s<sub>6</sub> == "azbzaz", the longest common prefix is "azb" which has a score of 3.
|
||
|
|
For s<sub>9</sub> == "azbazbzaz", the longest common prefix is "azbazbzaz" which has a score of 9.
|
||
|
|
For all other s<sub>i</sub>, the score is 0.
|
||
|
|
The sum of the scores is 2 + 3 + 9 = 14, so we return 14.
|
||
|
|
</pre>
|
||
|
|
|
||
|
|
<p> </p>
|
||
|
|
<p><strong>Constraints:</strong></p>
|
||
|
|
|
||
|
|
<ul>
|
||
|
|
<li><code>1 <= s.length <= 10<sup>5</sup></code></li>
|
||
|
|
<li><code>s</code> consists of lowercase English letters.</li>
|
||
|
|
</ul>
|