mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-09-11 10:21:43 +08:00
批量更新数据
This commit is contained in:
@@ -6,7 +6,7 @@
|
||||
|
||||
<p>During each player's turn, they <strong>must</strong> travel along one edge of the graph that meets where they are. For example, if the Mouse is at node 1, it <strong>must</strong> travel to any node in <code>graph[1]</code>.</p>
|
||||
|
||||
<p>Additionally, it is not allowed for the Cat to travel to the Hole (node 0.)</p>
|
||||
<p>Additionally, it is not allowed for the Cat to travel to the Hole (node <code>0</code>).</p>
|
||||
|
||||
<p>Then, the game can end in three ways:</p>
|
||||
|
||||
|
Reference in New Issue
Block a user