LeetCode-832. Flipping an Image

LeetCode-832. 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​​

​​题解：​​

我的编程宗旨：​​readability counts。​​

三目运算符的忠实反对者。

class Solution {public: vector> flipAndInvertImage(vector>& A) { int n = A.size(); int m = A[0].size(); for (int i = 0; i < n; i++) { reverse(A[i].begin(), A[i].end()); for (int j = 0; j < m; j++) { if (A[i][j] == 0) { A[i][j] = 1; } else if (A[i][j] == 1) { A[i][j] = 0; } } } return A; }};

版权声明：本文内容由网络用户投稿，版权归原作者所有，本站不拥有其著作权，亦不承担相应法律责任。如果您发现本站中有涉嫌抄袭或描述失实的内容，请联系我们jiasou666@gmail.com 处理，核实后本网站将在24小时内删除侵权内容。