mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-09-05 15:31:43 +08:00
存量题库数据更新
This commit is contained in:
@@ -13,7 +13,7 @@
|
||||
</ul>
|
||||
|
||||
|
||||
|
||||
|
||||
<p>The box is rotated <strong>90 degrees clockwise</strong>, causing some of the stones to fall due to gravity. Each stone falls down until it lands on an obstacle, another stone, or the bottom of the box. Gravity <strong>does not</strong> affect the obstacles' positions, and the inertia from the box's rotation <strong>does not </strong>affect the stones' horizontal positions.</p>
|
||||
|
||||
|
||||
@@ -24,7 +24,7 @@
|
||||
|
||||
<p>Return <em>an </em><code>n x m</code><em> matrix representing the box after the rotation described above</em>.</p>
|
||||
|
||||
|
||||
|
||||
|
||||
<p> </p>
|
||||
|
||||
@@ -37,7 +37,7 @@
|
||||
|
||||
|
||||
<pre>
|
||||
|
||||
|
||||
<strong>Input:</strong> box = [["#",".","#"]]
|
||||
|
||||
<strong>Output:</strong> [["."],
|
||||
|
Reference in New Issue
Block a user