花花酱 LeetCode 832. Flipping an Image

zxi — Sun, 13 May 2018 17:20:24 +0000

Problem

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

Solution 1: Brute Force

Time complexity: O(m*n)

Space complexity: O(m*n)

C++

// Author: Huahua
// Running time: 15 ms
class Solution {
public:
  vector> flipAndInvertImage(vector>& A) {
    auto B = A;
    int m = A.size();
    int n = A[0].size();
    for (int i = 0; i < m; ++i)
      for (int j = 0; j < n; ++j)
        B[i][j] = 1 - A[i][n - j - 1];
    return B;
  }
};

The post 花花酱 LeetCode 832. Flipping an Image appeared first on Huahua's Tech Road.

image Archives - Huahua's Tech Road

花花酱 LeetCode 832. Flipping an Image

Problem

Solution 1: Brute Force