Home LeetCode - 832. Flipping an Image
Post
Cancel

LeetCode - 832. Flipping an Image

832. Flipping an Image - easy

문제

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].

제한사항

  • 1 <= A.length = A[0].length <= 20
  • 0 <= A[i][j] <= 1

입출력 예

1
2
3
4
5
6
7
8
9
10
11
12
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]]

풀이

  • Array
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
class Solution {
public:
    vector<vector<int>> flipAndInvertImage(vector<vector<int>>& A) {
        for(auto& i : A){
            // 행을 뒤집음
            std::reverse(i.begin(), i.end());
            
            // 값을 뒤집음
            for(auto& j : i){
                j ^= 1;
            }
        }
            
        return A;
    }
};
This post is licensed under CC BY 4.0 by the author.