mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-01-11 02:58:13 +08:00
39 lines
2.4 KiB
HTML
39 lines
2.4 KiB
HTML
|
<p>You are given two integers <code>m</code> and <code>n</code> representing a <strong>0-indexed</strong> <code>m x n</code> grid. You are also given two 2D integer arrays <code>guards</code> and <code>walls</code> where <code>guards[i] = [row<sub>i</sub>, col<sub>i</sub>]</code> and <code>walls[j] = [row<sub>j</sub>, col<sub>j</sub>]</code> represent the positions of the <code>i<sup>th</sup></code> guard and <code>j<sup>th</sup></code> wall respectively.</p>
|
||
|
|
|
||
|
|
<p>A guard can see <b>every</b> cell in the four cardinal directions (north, east, south, or west) starting from their position unless <strong>obstructed</strong> by a wall or another guard. A cell is <strong>guarded</strong> if there is <strong>at least</strong> one guard that can see it.</p>
|
||
|
|
|
||
|
|
<p>Return<em> the number of unoccupied cells that are <strong>not</strong> <strong>guarded</strong>.</em></p>
|
||
|
|
|
||
|
|
<p> </p>
|
||
|
|
<p><strong>Example 1:</strong></p>
|
||
|
|
<img alt="" src="https://assets.leetcode.com/uploads/2022/03/10/example1drawio2.png" style="width: 300px; height: 204px;" />
|
||
|
|
<pre>
|
||
|
|
<strong>Input:</strong> m = 4, n = 6, guards = [[0,0],[1,1],[2,3]], walls = [[0,1],[2,2],[1,4]]
|
||
|
|
<strong>Output:</strong> 7
|
||
|
|
<strong>Explanation:</strong> The guarded and unguarded cells are shown in red and green respectively in the above diagram.
|
||
|
|
There are a total of 7 unguarded cells, so we return 7.
|
||
|
|
</pre>
|
||
|
|
|
||
|
|
<p><strong>Example 2:</strong></p>
|
||
|
|
<img alt="" src="https://assets.leetcode.com/uploads/2022/03/10/example2drawio.png" style="width: 200px; height: 201px;" />
|
||
|
|
<pre>
|
||
|
|
<strong>Input:</strong> m = 3, n = 3, guards = [[1,1]], walls = [[0,1],[1,0],[2,1],[1,2]]
|
||
|
|
<strong>Output:</strong> 4
|
||
|
|
<strong>Explanation:</strong> The unguarded cells are shown in green in the above diagram.
|
||
|
|
There are a total of 4 unguarded cells, so we return 4.
|
||
|
|
</pre>
|
||
|
|
|
||
|
|
<p> </p>
|
||
|
|
<p><strong>Constraints:</strong></p>
|
||
|
|
|
||
|
|
<ul>
|
||
|
|
<li><code>1 <= m, n <= 10<sup>5</sup></code></li>
|
||
|
|
<li><code>2 <= m * n <= 10<sup>5</sup></code></li>
|
||
|
|
<li><code>1 <= guards.length, walls.length <= 5 * 10<sup>4</sup></code></li>
|
||
|
|
<li><code>2 <= guards.length + walls.length <= m * n</code></li>
|
||
|
|
<li><code>guards[i].length == walls[j].length == 2</code></li>
|
||
|
|
<li><code>0 <= row<sub>i</sub>, row<sub>j</sub> < m</code></li>
|
||
|
|
<li><code>0 <= col<sub>i</sub>, col<sub>j</sub> < n</code></li>
|
||
|
|
<li>All the positions in <code>guards</code> and <code>walls</code> are <strong>unique</strong>.</li>
|
||
|
|
</ul>
|