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

给定一个只包含0、1的矩阵A,把它当做一张图片,我们想要水平翻转这张图片,然后在在invert 它,最后返回结果图片

水平翻转意味着图片的每一行都被颠倒,例如[1, 1, 0]水平翻转后得到[0, 1, 1]

invert一张图片意味着将对应元素取反,0变成1,1变成0。例如[0, 1, 1]变成[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

Solutions:

Python

class Solution:
    def flipAndInvertImage(self, A):
        """
        :type A: List[List[int]]
        :rtype: List[List[int]]
        """
        for i in range(len(A)):
            A[i] = A[i][::-1]   #等价于A[i] = A[i].reverse()
            
        for i in range(len(A)):
            for j in range(len(A[0])):
                A[i][j] = 1-A[i][j]
                
        return A

 

C++

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


(2)
class Solution {
public:
    vector<vector<int>> flipAndInvertImage(vector<vector<int>>& A) {
        for(vector<vector<int>>::iterator it = A.begin(); it != A.end(); it++)
            reverse(it->begin(), it->end());
        for(vector<vector<int>>::iterator it = A.begin(); it != A.end(); it++)
            for(vector<int>::iterator i = it->begin(); i != it->end(); i++)
                *i = (*i) ^ 1;
        return A;
    }
};

 

 

 

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值