mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-01-10 18:48:13 +08:00
39 lines
1.2 KiB
HTML
39 lines
1.2 KiB
HTML
<p>Given a rectangle of size <code>n</code> x <code>m</code>, return <em>the minimum number of integer-sided squares that tile the rectangle</em>.</p>
|
|
|
|
<p> </p>
|
|
<p><strong>Example 1:</strong></p>
|
|
|
|
<p><img alt="" src="https://assets.leetcode.com/uploads/2019/10/17/sample_11_1592.png" style="width: 154px; height: 106px;" /></p>
|
|
|
|
<pre>
|
|
<strong>Input:</strong> n = 2, m = 3
|
|
<strong>Output:</strong> 3
|
|
<strong>Explanation:</strong> <code>3</code> squares are necessary to cover the rectangle.
|
|
<code>2</code> (squares of <code>1x1</code>)
|
|
<code>1</code> (square of <code>2x2</code>)</pre>
|
|
|
|
<p><strong>Example 2:</strong></p>
|
|
|
|
<p><img alt="" src="https://assets.leetcode.com/uploads/2019/10/17/sample_22_1592.png" style="width: 224px; height: 126px;" /></p>
|
|
|
|
<pre>
|
|
<strong>Input:</strong> n = 5, m = 8
|
|
<strong>Output:</strong> 5
|
|
</pre>
|
|
|
|
<p><strong>Example 3:</strong></p>
|
|
|
|
<p><img alt="" src="https://assets.leetcode.com/uploads/2019/10/17/sample_33_1592.png" style="width: 224px; height: 189px;" /></p>
|
|
|
|
<pre>
|
|
<strong>Input:</strong> n = 11, m = 13
|
|
<strong>Output:</strong> 6
|
|
</pre>
|
|
|
|
<p> </p>
|
|
<p><strong>Constraints:</strong></p>
|
|
|
|
<ul>
|
|
<li><code>1 <= n, m <= 13</code></li>
|
|
</ul>
|