翻转图像
给定一个二进制矩阵 A
,我们想先水平翻转图像,然后反转图像并返回结果。
水平翻转图片就是将图片的每一行都进行翻转,即逆序。例如,水平翻转 [1, 1, 0]
的结果是 [0, 1, 1]
。
反转图片的意思是图片中的 0
全部被 1
替换, 1
全部被 0
替换。例如,反转 [0, 1, 1]
的结果是 [1, 0, 0]
。
示例 1:
输入:[[1,1,0],[1,0,1],[0,0,0]]
输出:[[1,0,0],[0,1,0],[1,1,1]]
解释:首先翻转每一行: [[0,1,1],[1,0,1],[0,0,0]];
然后反转图片: [[1,0,0],[0,1,0],[1,1,1]]
示例 2:
输入:[[1,1,0,0],[1,0,0,1],[0,1,1,1],[1,0,1,0]]
输出:[[1,1,0,0],[0,1,1,0],[0,0,0,1],[1,0,1,0]]
解释:首先翻转每一行: [[0,0,1,1],[1,0,0,1],[1,1,1,0],[0,1,0,1]];
然后反转图片: [[1,1,0,0],[0,1,1,0],[0,0,0,1],[1,0,1,0]]
提示:
1 <= A.length = A[0].length <= 20
0 <= A[i][j] <= 1
Flipping an Image
Given a binary matrix A
, we want to flip the image horizontally, then invert it, and return the resulting image.
To flip an image horizontally means that each row of the image is reversed. For example, flipping [1, 1, 0]
horizontally results in [0, 1, 1]
.
To invert an image means that each 0
is replaced by 1
, and each 1
is replaced by 0
. For example, inverting [0, 1, 1]
results in [1, 0, 0]
.
Example 1:
Input: [[1,1,0],[1,0,1],[0,0,0]]
Output: [[1,0,0],[0,1,0],[1,1,1]]
Explanation: 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]]
Example 2:
Input: [[1,1,0,0],[1,0,0,1],[0,1,1,1],[1,0,1,0]]
Output: [[1,1,0,0],[0,1,1,0],[0,0,0,1],[1,0,1,0]]
Explanation: 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]]
Notes:
1 <= A.length = A[0].length <= 20
0 <= A[i][j] <= 1
解
方法一:暴力法
最简答的方法,需要遍历两次矩阵。代码略。
方法二:双指针+异或
我们思考只需要遍历一次的方法。
想到翻转需要考虑对称位置的值,设当前元素为A[i][j]
,矩阵为n×n
,则对称位置为A[i][n-j-1]
,(注:这里也可以使用双指针)因此容易得出以下四种情况:
- A [ i ] [ j ] = 0 , A [ i ] [ n − j − 1 ] = 0 A[i][j]=0,A[i][n-j-1]=0 A[i][j]=0,A[i][n−j−1]=0,经过翻转然后反转后为 A [ i ] [ j ] = 1 , A [ i ] [ n − j − 1 ] = 1 A[i][j]=1,A[i][n-j-1]=1 A[i][j]=1,A[i][n−j−1]=1
- A [ i ] [ j ] = 1 , A [ i ] [ n − j − 1 ] = 1 A[i][j]=1,A[i][n-j-1]=1 A[i][j]=1,A[i][n−j−1]=1,经过翻转然后反转后为 A [ i ] [ j ] = 0 , A [ i ] [ n − j − 1 ] = 0 A[i][j]=0,A[i][n-j-1]=0 A[i][j]=0,A[i][n−j−1]=0
- A [ i ] [ j ] = 1 , A [ i ] [ n − j − 1 ] = 0 A[i][j]=1,A[i][n-j-1]=0 A[i][j]=1,A[i][n−j−1]=0,经过翻转然后反转后为 A [ i ] [ j ] = 1 , A [ i ] [ n − j − 1 ] = 0 A[i][j]=1,A[i][n-j-1]=0 A[i][j]=1,A[i][n−j−1]=0
- A [ i ] [ j ] = 0 , A [ i ] [ n − j − 1 ] = 1 A[i][j]=0,A[i][n-j-1]=1 A[i][j]=0,A[i][n−j−1]=1,经过翻转然后反转后为 A [ i ] [ j ] = 0 , A [ i ] [ n − j − 1 ] = 1 A[i][j]=0,A[i][n-j-1]=1 A[i][j]=0,A[i][n−j−1]=1
以上四种情况可以概括为以下两种情况:
- 若 A [ i ] [ j ] = A [ i ] [ n − j − 1 ] A[i][j]=A[i][n-j-1] A[i][j]=A[i][n−j−1],则值改变。
- 若 A [ i ] [ j ] ! = A [ i ] [ n − j − 1 ] A[i][j]!=A[i][n-j-1] A[i][j]!=A[i][n−j−1],则值不变。
注:
1
和0
的变换我们可以通过异或实现。- 若
n
为奇数,则中间的数需要反转。
class Solution {
public:
vector<vector<int>> flipAndInvertImage(vector<vector<int>>& A) {
int n = A.size();
for (int i = 0; i < n; ++i) {
for (int j = 0; j < (n + 1) / 2; ++j) {
if (A[i][j] == A[i][n - j - 1]) {
A[i][j] = A[i][n - j - 1] ^= 1;
// A[i][n - j - 1] ^= 1;
}
}
}
return A;
}
};