mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-01-27 02:30:28 +08:00
68 lines
2.6 KiB
HTML
68 lines
2.6 KiB
HTML
|
<p>给你一个大小为 <code>m x n</code> 的二维矩形 <code>grid</code> 。每次 <strong>操作</strong> 中，你可以将 <strong>任一</strong> 格子的值修改为 <strong>任意</strong> 非负整数。完成所有操作后，你需要确保每个格子 <code>grid[i][j]</code> 的值满足：</p>
|
|||
|
|
|
|||
|
|
<ul>
|
|||
|
|
<li>如果下面相邻格子存在的话，它们的值相等，也就是 <code>grid[i][j] == grid[i + 1][j]</code>（如果存在）。</li>
|
|||
|
|
<li>如果右边相邻格子存在的话，它们的值不相等，也就是 <code>grid[i][j] != grid[i][j + 1]</code>（如果存在）。</li>
|
|||
|
|
</ul>
|
|||
|
|
|
|||
|
|
<p>请你返回需要的 <strong>最少</strong> 操作数目。</p>
|
|||
|
|
|
|||
|
|
<p> </p>
|
|||
|
|
|
|||
|
|
<p><strong class="example">示例 1：</strong></p>
|
|||
|
|
|
|||
|
|
<div class="example-block">
|
|||
|
|
<p><span class="example-io"><b>输入：</b>grid = [[1,0,2],[1,0,2]]</span></p>
|
|||
|
|
|
|||
|
|
<p><b>输出：</b>0</p>
|
|||
|
|
|
|||
|
|
<p><b>解释：</b></p>
|
|||
|
|
|
|||
|
|
<p><strong><img alt="" src="https://assets.leetcode.com/uploads/2024/04/15/examplechanged.png" style="width: 254px; height: 186px;padding: 10px; background: #fff; border-radius: .5rem;" /></strong></p>
|
|||
|
|
|
|||
|
|
<p>矩阵中所有格子已经满足要求。</p>
|
|||
|
|
</div>
|
|||
|
|
|
|||
|
|
<p><strong class="example">示例 2：</strong></p>
|
|||
|
|
|
|||
|
|
<div class="example-block">
|
|||
|
|
<p><span class="example-io"><b>输入：</b>grid = [[1,1,1],[0,0,0]]</span></p>
|
|||
|
|
|
|||
|
|
<p><b>输出：</b>3</p>
|
|||
|
|
|
|||
|
|
<p><strong>解释：</strong></p>
|
|||
|
|
|
|||
|
|
<p><strong><img alt="" src="https://assets.leetcode.com/uploads/2024/03/27/example21.png" style="width: 254px; height: 186px;padding: 10px; background: #fff; border-radius: .5rem;" /></strong></p>
|
|||
|
|
|
|||
|
|
<p>将矩阵变成 <code>[[1,0,1],[1,0,1]]</code> ，它满足所有要求，需要 3 次操作：</p>
|
|||
|
|
|
|||
|
|
<ul>
|
|||
|
|
<li>将 <code>grid[1][0]</code> 变为 1 。</li>
|
|||
|
|
<li>将 <code>grid[0][1]</code> 变为 0 。</li>
|
|||
|
|
<li>将 <code>grid[1][2]</code> 变为 1 。</li>
|
|||
|
|
</ul>
|
|||
|
|
</div>
|
|||
|
|
|
|||
|
|
<p><strong class="example">示例 3：</strong></p>
|
|||
|
|
|
|||
|
|
<div class="example-block">
|
|||
|
|
<p><span class="example-io"><b>输入：</b>grid = [[1],[2],[3]]</span></p>
|
|||
|
|
|
|||
|
|
<p><b>输出：</b>2</p>
|
|||
|
|
|
|||
|
|
<p><strong>解释：</strong></p>
|
|||
|
|
|
|||
|
|
<p><img alt="" src="https://assets.leetcode.com/uploads/2024/03/31/changed.png" style="width: 86px; height: 277px;padding: 10px; background: #fff; border-radius: .5rem;" /></p>
|
|||
|
|
|
|||
|
|
<p>这个矩阵只有一列，我们可以通过 2 次操作将所有格子里的值变为 1 。</p>
|
|||
|
|
</div>
|
|||
|
|
|
|||
|
|
<p> </p>
|
|||
|
|
|
|||
|
|
<p><strong>提示：</strong></p>
|
|||
|
|
|
|||
|
|
<ul>
|
|||
|
|
<li><code>1 <= n, m <= 1000</code></li>
|
|||
|
|
<li><code>0 <= grid[i][j] <= 9</code></li>
|
|||
|
|
</ul>
|