mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-10-13 01:15:14 +08:00
update
This commit is contained in:
@@ -10,7 +10,8 @@
|
||||
|
||||
<p><strong>示例 1:</strong></p>
|
||||
|
||||
<pre><strong>输入:</strong>stoneValue = [6,2,3,4,5,5]
|
||||
<pre>
|
||||
<strong>输入:</strong>stoneValue = [6,2,3,4,5,5]
|
||||
<strong>输出:</strong>18
|
||||
<strong>解释:</strong>在第一轮中,Alice 将行划分为 [6,2,3],[4,5,5] 。左行的值是 11 ,右行的值是 14 。Bob 丢弃了右行,Alice 的分数现在是 11 。
|
||||
在第二轮中,Alice 将行分成 [6],[2,3] 。这一次 Bob 扔掉了左行,Alice 的分数变成了 16(11 + 5)。
|
||||
@@ -19,13 +20,15 @@
|
||||
|
||||
<p><strong>示例 2:</strong></p>
|
||||
|
||||
<pre><strong>输入:</strong>stoneValue = [7,7,7,7,7,7,7]
|
||||
<pre>
|
||||
<strong>输入:</strong>stoneValue = [7,7,7,7,7,7,7]
|
||||
<strong>输出:</strong>28
|
||||
</pre>
|
||||
|
||||
<p><strong>示例 3:</strong></p>
|
||||
|
||||
<pre><strong>输入:</strong>stoneValue = [4]
|
||||
<pre>
|
||||
<strong>输入:</strong>stoneValue = [4]
|
||||
<strong>输出:</strong>0
|
||||
</pre>
|
||||
|
||||
@@ -35,5 +38,5 @@
|
||||
|
||||
<ul>
|
||||
<li><code>1 <= stoneValue.length <= 500</code></li>
|
||||
<li><code>1 <= stoneValue[i] <= 10^6</code></li>
|
||||
<li><code>1 <= stoneValue[i] <= 10<sup>6</sup></code></li>
|
||||
</ul>
|
||||
|
Reference in New Issue
Block a user