[leetcode] 832. Flipping an Image

最新推荐文章于 2023-02-25 22:41:55 发布

weixin_30710457

最新推荐文章于 2023-02-25 22:41:55 发布

阅读量51

点赞数

CC 4.0 BY-SA版权

文章标签：数据结构与算法 c/c++

原文链接：http://www.cnblogs.com/guweixin/p/10413942.html

本文详细解析了如何对二进制矩阵进行水平翻转和元素取反操作，通过具体实例展示了算法步骤，并提供了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

思路:

c++代码实现:

class Solution {
public:
    vector<vector<int>> flipAndInvertImage(vector<vector<int>>& A) {
        vector<int> b;
        vector<vector<int>> B;
        for(int i=0; i<A.size(); i++)
        {
            for(int j=A[i].size()-1; j>=0; j--)
            {
                int k=1-A[i][j];
                b.push_back(k);
            }
            B.push_back(b);
            b.clear();
        }
        return B;
    }
};

　　(或者用"异或")

转载于:https://www.cnblogs.com/guweixin/p/10413942.html