mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-11-04 19:53:12 +08:00
43 lines
1.5 KiB
HTML
43 lines
1.5 KiB
HTML
<p>Given an <code>n x n</code> binary matrix <code>image</code>, flip the image <strong>horizontally</strong>, then invert it, and return <em>the resulting image</em>.</p>
|
|
|
|
<p>To flip an image horizontally means that each row of the image is reversed.</p>
|
|
|
|
<ul>
|
|
<li>For example, flipping <code>[1,1,0]</code> horizontally results in <code>[0,1,1]</code>.</li>
|
|
</ul>
|
|
|
|
<p>To invert an image means that each <code>0</code> is replaced by <code>1</code>, and each <code>1</code> is replaced by <code>0</code>.</p>
|
|
|
|
<ul>
|
|
<li>For example, inverting <code>[0,1,1]</code> results in <code>[1,0,0]</code>.</li>
|
|
</ul>
|
|
|
|
<p> </p>
|
|
<p><strong>Example 1:</strong></p>
|
|
|
|
<pre>
|
|
<strong>Input:</strong> image = [[1,1,0],[1,0,1],[0,0,0]]
|
|
<strong>Output:</strong> [[1,0,0],[0,1,0],[1,1,1]]
|
|
<strong>Explanation:</strong> First reverse each row: [[0,1,1],[1,0,1],[0,0,0]].
|
|
Then, invert the image: [[1,0,0],[0,1,0],[1,1,1]]
|
|
</pre>
|
|
|
|
<p><strong>Example 2:</strong></p>
|
|
|
|
<pre>
|
|
<strong>Input:</strong> image = [[1,1,0,0],[1,0,0,1],[0,1,1,1],[1,0,1,0]]
|
|
<strong>Output:</strong> [[1,1,0,0],[0,1,1,0],[0,0,0,1],[1,0,1,0]]
|
|
<strong>Explanation:</strong> First reverse each row: [[0,0,1,1],[1,0,0,1],[1,1,1,0],[0,1,0,1]].
|
|
Then invert the image: [[1,1,0,0],[0,1,1,0],[0,0,0,1],[1,0,1,0]]
|
|
</pre>
|
|
|
|
<p> </p>
|
|
<p><strong>Constraints:</strong></p>
|
|
|
|
<ul>
|
|
<li><code>n == image.length</code></li>
|
|
<li><code>n == image[i].length</code></li>
|
|
<li><code>1 <= n <= 20</code></li>
|
|
<li><code>images[i][j]</code> is either <code>0</code> or <code>1</code>.</li>
|
|
</ul>
|