mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-01-11 02:58:13 +08:00
41 lines
2.1 KiB
HTML
41 lines
2.1 KiB
HTML
|
<p>You are given a <strong>0-indexed binary</strong> string <code>floor</code>, which represents the colors of tiles on a floor:</p>
|
||
|
|
|
||
|
|
<ul>
|
||
|
|
<li><code>floor[i] = '0'</code> denotes that the <code>i<sup>th</sup></code> tile of the floor is colored <strong>black</strong>.</li>
|
||
|
|
<li>On the other hand, <code>floor[i] = '1'</code> denotes that the <code>i<sup>th</sup></code> tile of the floor is colored <strong>white</strong>.</li>
|
||
|
|
</ul>
|
||
|
|
|
||
|
|
<p>You are also given <code>numCarpets</code> and <code>carpetLen</code>. You have <code>numCarpets</code> <strong>black</strong> carpets, each of length <code>carpetLen</code> tiles. Cover the tiles with the given carpets such that the number of <strong>white</strong> tiles still visible is <strong>minimum</strong>. Carpets may overlap one another.</p>
|
||
|
|
|
||
|
|
<p>Return <em>the <strong>minimum</strong> number of white tiles still visible.</em></p>
|
||
|
|
|
||
|
|
<p> </p>
|
||
|
|
<p><strong>Example 1:</strong></p>
|
||
|
|
<img alt="" src="https://assets.leetcode.com/uploads/2022/02/10/ex1-1.png" style="width: 400px; height: 73px;" />
|
||
|
|
<pre>
|
||
|
|
<strong>Input:</strong> floor = "10110101", numCarpets = 2, carpetLen = 2
|
||
|
|
<strong>Output:</strong> 2
|
||
|
|
<strong>Explanation:</strong>
|
||
|
|
The figure above shows one way of covering the tiles with the carpets such that only 2 white tiles are visible.
|
||
|
|
No other way of covering the tiles with the carpets can leave less than 2 white tiles visible.
|
||
|
|
</pre>
|
||
|
|
|
||
|
|
<p><strong>Example 2:</strong></p>
|
||
|
|
<img alt="" src="https://assets.leetcode.com/uploads/2022/02/10/ex2.png" style="width: 353px; height: 123px;" />
|
||
|
|
<pre>
|
||
|
|
<strong>Input:</strong> floor = "11111", numCarpets = 2, carpetLen = 3
|
||
|
|
<strong>Output:</strong> 0
|
||
|
|
<strong>Explanation:</strong>
|
||
|
|
The figure above shows one way of covering the tiles with the carpets such that no white tiles are visible.
|
||
|
|
Note that the carpets are able to overlap one another.
|
||
|
|
</pre>
|
||
|
|
|
||
|
|
<p> </p>
|
||
|
|
<p><strong>Constraints:</strong></p>
|
||
|
|
|
||
|
|
<ul>
|
||
|
|
<li><code>1 <= carpetLen <= floor.length <= 1000</code></li>
|
||
|
|
<li><code>floor[i]</code> is either <code>'0'</code> or <code>'1'</code>.</li>
|
||
|
|
<li><code>1 <= numCarpets <= 1000</code></li>
|
||
|
|
</ul>
|