mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-09-04 06:51:41 +08:00
存量题库数据更新
This commit is contained in:
@@ -32,7 +32,7 @@
|
||||
<p>Given a <code>rows x cols</code> matrix <code>grid</code> and two integers <code>catJump</code> and <code>mouseJump</code>, return <code>true</code><em> if Mouse can win the game if both Cat and Mouse play optimally, otherwise return </em><code>false</code>.</p>
|
||||
|
||||
<p> </p>
|
||||
<p><strong>Example 1:</strong></p>
|
||||
<p><strong class="example">Example 1:</strong></p>
|
||||
<img alt="" src="https://assets.leetcode.com/uploads/2020/09/12/sample_111_1955.png" style="width: 580px; height: 239px;" />
|
||||
<pre>
|
||||
<strong>Input:</strong> grid = ["####F","#C...","M...."], catJump = 1, mouseJump = 2
|
||||
@@ -40,14 +40,14 @@
|
||||
<strong>Explanation:</strong> Cat cannot catch Mouse on its turn nor can it get the food before Mouse.
|
||||
</pre>
|
||||
|
||||
<p><strong>Example 2:</strong></p>
|
||||
<p><strong class="example">Example 2:</strong></p>
|
||||
<img alt="" src="https://assets.leetcode.com/uploads/2020/09/12/sample_2_1955.png" style="width: 580px; height: 175px;" />
|
||||
<pre>
|
||||
<strong>Input:</strong> grid = ["M.C...F"], catJump = 1, mouseJump = 4
|
||||
<strong>Output:</strong> true
|
||||
</pre>
|
||||
|
||||
<p><strong>Example 3:</strong></p>
|
||||
<p><strong class="example">Example 3:</strong></p>
|
||||
|
||||
<pre>
|
||||
<strong>Input:</strong> grid = ["M.C...F"], catJump = 1, mouseJump = 3
|
||||
|
Reference in New Issue
Block a user