mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-09-07 08:21:41 +08:00
存量题库数据更新
This commit is contained in:
@@ -9,7 +9,7 @@
|
||||
<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>
|
||||
<p><strong class="example">Example 1:</strong></p>
|
||||
|
||||
<pre>
|
||||
<strong>Input:</strong> s = "babab"
|
||||
@@ -22,7 +22,7 @@ For s<sub>4</sub> == "abab", there is no common prefix so the score is
|
||||
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>
|
||||
<p><strong class="example">Example 2:</strong></p>
|
||||
|
||||
<pre>
|
||||
<strong>Input:</strong> s = "azbazbzaz"
|
||||
|
Reference in New Issue
Block a user