coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-05 15:31:43 +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/problem/knight-probability-in-chessboard.html
View File

@@ -9,7 +9,7 @@
<p>Return <em>the probability that the knight remains on the board after it has stopped moving</em>.</p>
<p>&nbsp;</p>
<p><strong>Example 1:</strong></p>
<p><strong class="example">Example 1:</strong></p>
<pre>
<strong>Input:</strong> n = 3, k = 2, row = 0, column = 0
@@ -19,7 +19,7 @@ From each of those positions, there are also two moves that will keep the knight
The total probability the knight stays on the board is 0.0625.
</pre>
<p><strong>Example 2:</strong></p>
<p><strong class="example">Example 2:</strong></p>
<pre>
<strong>Input:</strong> n = 1, k = 0, row = 0, column = 0
@@ -32,5 +32,5 @@ The total probability the knight stays on the board is 0.0625.
<ul>
<li><code>1 &lt;= n &lt;= 25</code></li>
<li><code>0 &lt;= k &lt;= 100</code></li>
<li><code>0 &lt;= row, column &lt;= n</code></li>
<li><code>0 &lt;= row, column &lt;= n - 1</code></li>
</ul>