[LeetCode]832.Flipping an Image 解题报告(C++)

[LeetCode]832.Flipping an Image 解题报告(C++)

题目描述

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

题目大意

• 给定一个二进制的矩阵,水平的翻转它.
• 并且将 0 -> 1 , 1- >0

解题思路

• 逐行进行操作
• 每一行从左右进行交换,并与 1 进行亦或 ^ !
• 注意: 当左右坐标相等时候,只做一次异或 ^ !!!

代码实现:

vector<vector<int>> flipAndInvertImage(vector<vector<int>>& A) {

    int rows = A.size();
    int clo = A[0].size();

    for (int h = 0; h < rows; h++) {
        int i = 0, j = clo - 1;
        while(i <= j) {
            swap(A[h][i], A[h][j]);
            if (i == j) {
                A[h][i] ^= 1;
            }
            else {
                A[h][i] ^= 1;
                A[h][j] ^= 1;
            }
            i++;
            j--;
        }
    }
    return A;
}

小结

• 这是 Array_Easy 通过率最高的一题.