coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-04 15:01:40 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee

存量题库数据更新

Browse Source
This commit is contained in:
小墨
2023-12-09 18:42:21 +08:00
parent a788808cd7
commit c198538f10
10843 changed files with 288489 additions and 248355 deletions
Download Patch File Download Diff File Expand all files Collapse all files

6
leetcode-cn/problem (English)/石子游戏 VI(English) [stone-game-vi].html
View File

@@ -15,7 +15,7 @@
</ul>
<p>&nbsp;</p>
<p><strong>Example 1:</strong></p>
<p><strong class="example">Example 1:</strong></p>
<pre>
<strong>Input:</strong> aliceValues = [1,3], bobValues = [2,1]
@@ -26,7 +26,7 @@ Bob can only choose stone 0, and will only receive 2 points.
Alice wins.
</pre>
<p><strong>Example 2:</strong></p>
<p><strong class="example">Example 2:</strong></p>
<pre>
<strong>Input:</strong> aliceValues = [1,2], bobValues = [3,1]
@@ -36,7 +36,7 @@ If Alice takes stone 0, and Bob takes stone 1, they will both have 1 point.
Draw.
</pre>
<p><strong>Example 3:</strong></p>
<p><strong class="example">Example 3:</strong></p>
<pre>
<strong>Input:</strong> aliceValues = [2,4,3], bobValues = [1,6,7]